Numerical Algorithms
Publisher: Springer Nature · ISSN 1017-1398,1572-9265 · 526 articles
- Double inertial self-adaptive methods for bilevel and trilevel optimization problems
- Higher-order exponential Runge-Kutta Galerkin finite element method for semilinear parabolic problems with nonsmooth initial data
- A mixed interpolation-regression method for function approximation on certain planar domains
- A mass- and modified-energy-conserving linearly implicit Crank–Nicolson finite element method for the rotating Gross–Pitaevskii equation
- Data dependent Shepard approximation through an adaptive modification of the shape parameter
- An efficient hybrid Chebyshev spectral method for multidimensional time-fractional partial integro-differential equations
- On the convergence of modified Tseng extragradient methods with double inertial technique for nonmonotone variational inequalities
- A family of hybrid derivative-free projection methods with a backtracking self-adaptive line search for solving pseudo-monotone nonlinear equations with applications
- Optimized Schwarz methods in time for discrete transport control
-
A class of efficient linearly implicit methods based on TASE operators for Volterra integral equations
Abstract This paper presents a family of numerical methods for the solution of Volterra integral equations of the second kind. The proposed approach combines a class of Runge–Kutta methods for ordinary differential equations with TASE...
- Efficient numerical solution of the Hunter–Saxton equation via wavelet collocation method
- A mapped spectral method for 3D Fredholm integro-differential equations on curved domains
- Solution-informed regularized Anderson accelerated optimization methods for unconstrained optimization problems
- Schröder-like families as subfamilies of Simeunović’s general scheme: Commentary and historical notes
- A new efficient heuristic method for regularization parameter determination
- Fast computation of eigenvalues of periodic CMV matrices
- Local error estimation for implicit-explicit general linear methods
- Postprocessing techniques for piecewise polynomial collocation methods applied to third-kind volterra integral equations
- Stable evaluation of Caputo fractional derivatives from noisy data via local regularization
-
High-fidelity image analysis of archaeological artifacts using adaptive polynomial approximation
Abstract This paper presents a unified, adaptive framework for image approximation and edge detection based on bivariate polynomial approximation techniques, explicitly focusing on archaeological imaging applications. Motivated by the...
- Quantum block encoding for one-pair semiseparable matrices
- Boţ–Nguyen acceleration, weighted mean ergodic iteration, and the beta-binomial distribution
- A semismooth Newton-based proximal augmented Lagrangian method for joint estimation of multiple Gaussian graphical models with clustered structure
- Sandwich convergence rates and certified error bounds for outer approximation in convex vector optimization
- Energy norm error estimates of a hybrid high-order method for the linear parabolic integro-differential equations on general meshes
- A Stokes-profile central-line two-level Schwarz method for unsteady incompressible Navier-Stokes equations in three-dimensional arteries
- A unified eighth-order numerical method for even-order equations with Lidstone boundary conditions
-
Computation of the zeros of Laguerre–Sobolev polynomials by the Ehrlich–Aberth method
Abstract A new algorithm for computing all the zeros of Laguerre–Sobolev orthogonal polynomials, based on the Ehrlich–Aberth method, is described in this work. The Ehrlich–Aberth method is a Newton–like method, requiring, at each...
- A modified optimal sixth-order quasi-B-spline collocation method for third-order Emden–Fowler equations
- A novel nonconvex rank approximation quaternion matrix completion model and its application in color image inpainting