Iterative solution of large sparse systems of equations

DOI10.1007/978-3-319-28483-5zbMath1347.65063OpenAlexW4292025407WikidataQ60264579 ScholiaQ60264579MaRDI QIDQ289671

Publication date: 30 May 2016

Published in: Applied Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28483-5

zbMATH Keywords

subspace methods domain decomposition conjugate gradient method iterative methods gradient method hierarchical matrices $\mathcal{H}$-LU iteration algebra of linear iterations classical linear iterations facts from linear algebra Galerkin discretisation of elliptic PDEs generation of iterations monography multigrid iterations positive definite iterations semi-iterative methods tensor-based methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (31)

Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting) ⋮ Spectral coarse spaces for the substructured parallel Schwarz method ⋮ Multilevel symmetrized Toeplitz structures and spectral distribution results for the related matrix-sequences ⋮ On the Ideal Interpolation Operator in Algebraic Multigrid Methods ⋮ Locally-synchronous, iterative solver for Fourier-based homogenization ⋮ A parallel Monte Carlo method for solving electromagnetic scattering in clusters of dielectric objects ⋮ The $\mathcal{H}_2$-optimal Control Problem of CSVIU Systems: Discounted, Counterdiscounted, and Long-Run Solutions ⋮ Relaxation parameters and composite refinement techniques ⋮ On the Condition Number of the Shifted Real Ginibre Ensemble ⋮ A Uniform Preconditioner for a Newton Algorithm for Total Variation Minimization and Minimum-Surface Problems ⋮ A data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems ⋮ Robust finite element discretization and solvers for distributed elliptic optimal control problems ⋮ A linear algebra perspective on the random multi-block ADMM: the QP case ⋮ An adaptive finite element method for distributed elliptic optimal control problems with variable energy regularization ⋮ Domain decomposition methods in scattered data interpolation with conditionally positive definite radial basis functions ⋮ Unnamed Item ⋮ Analysis of the iteratively regularized Gauss–Newton method under a heuristic rule ⋮ An adaptive Monte Carlo algorithm for European and American options ⋮ $p$-multigrid with partial smoothing: an efficient preconditioner for discontinuous Galerkin discretizations with modal bases ⋮ A discrepancy principle for the Landweber iteration based on risk minimization ⋮ Heuristic rule for non-stationary iterated Tikhonov regularization in Banach spaces ⋮ Stabilized leapfrog based local time-stepping method for the wave equation ⋮ Uncertainty calibration for probabilistic projection methods ⋮ Iterative Solution of Saddle-Point Systems from Radial Basis Function (RBF) Interpolation ⋮ Fixing Nonconvergence of Algebraic Iterative Reconstruction with an Unmatched Backprojector ⋮ Enhanced relaxed physical factorization preconditioner for coupled poromechanics ⋮ A note on overrelaxation in the Sinkhorn algorithm ⋮ The two-point gradient methods for nonlinear inverse problems based on Bregman projections ⋮ Regularization of inverse problems by two-point gradient methods in Banach spaces ⋮ Discrete Projections: A Step Towards Particle Methods on Bounded Domains without Remeshing ⋮ Gaussian Belief Propagation Solvers for Nonsymmetric Systems of Linear Equations

This page was built for publication: Iterative solution of large sparse systems of equations