Chebyshev-type methods and preconditioning techniques
From MaRDI portal
Publication:720610
DOI10.1016/j.amc.2011.05.036zbMath1226.65024OpenAlexW2085850889MaRDI QIDQ720610
Hou-Biao Li, Xing-Ping Liu, Tong-Xiang Gu, Ting-Zhu Huang, Yong Zhang
Publication date: 11 October 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.05.036
Related Items (32)
Exploiting higher computational efficiency index for computing outer generalized inverses ⋮ An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse ⋮ An efficient matrix iteration family for finding the generalized outer inverse ⋮ On finding robust approximate inverses for large sparse matrices ⋮ The method of particular solutions for solving nonlinear Poisson problems ⋮ A new iterative method for finding approximate inverses of complex matrices ⋮ An efficient matrix iterative method for computing Moore-Penrose inverse ⋮ Solving fourth order differential equations using particular solutions of Helmholtz-type equations ⋮ An improved computationally efficient method for finding the Drazin inverse ⋮ Representation learning on unit ball with 3D roto-translational equivariance ⋮ Finding generalized inverses by a fast and efficient numerical method ⋮ An efficient computation of generalized inverse of a matrix ⋮ The LMAPS Using Polynomial Basis Functions for Near-Singular Problems ⋮ An efficient method to compute the Moore-Penrose inverse ⋮ A general class of arbitrary order iterative methods for computing generalized inverses ⋮ Local RBF Algorithms for Elliptic Boundary Value Problems in Annular Domains ⋮ Factorizations of hyperpower family of iterative methods via least squares approach ⋮ The MAPS based on trigonometric basis functions for solving elliptic partial differential equations with variable coefficients and Cauchy-Navier equations ⋮ Localized meshless methods based on polynomial basis functions for solving axisymmetric equations ⋮ The LMAPS for solving fourth-order PDEs with polynomial basis functions ⋮ An efficient MAPS for solving fourth order partial differential equations using trigonometric functions ⋮ A rapid numerical algorithm to compute matrix inversion ⋮ An efficient method of approximate particular solutions using polynomial basis functions ⋮ Hybrid method of space-time and Houbolt methods for solving linear time-dependent problems ⋮ An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) ⋮ An efficient quadratically convergent iterative method to find the Moore–Penrose inverse ⋮ A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis ⋮ A fast convergent iterative solver for approximate inverse of matrices ⋮ Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\) ⋮ A two-step inexact Newton-Chebyshev-like method for inverse eigenvalue problems ⋮ A high-order iterate method for computing \(A_{T, S}^{(2)}\) ⋮ Finding the Moore-Penrose inverse by a new matrix iteration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new scheme of computing the approximate inverse preconditioner for the reduced linear systems
- Computational algorithms for computing the inverse of a square matrix, quasi-inverse of a non-square matrix and block matrices
- A note on computational algorithm for the inverse of a square matrix
- Approximate iterations for structured matrices
- Singularity, Wielandt's Lemma and singular values
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
- Comparisons of weak regular splittings and multisplitting methods
- Navier-Stokes calculations with a coupled strongly implicit method. I. Finite-difference solutions
- On a Newton-Moser type method
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- Geometric constructions of iterative functions to solve nonlinear equations
- Block ILU factorization preconditioners for a block-tridiagonal \(H\)-matrix
- Newton-like iteration based on a cubic polynomial for structured matrices
- On a new criterion for the H-matrix property
- A modified Chebyshev's iterative method with at least sixth order of convergence
- Additive preconditioning and aggregation in matrix computations
- A geometric construction of iterative functions of order three to solve nonlinear equations
- The Ulm method under mild differentiability conditions
- A note on a modification of Moser's method
- An improvement on a new upper bound for moduli of eigenvalues of iterative matrices
- On the diagonal approximation of full matrices
- Third-order iterative methods under Kantorovich conditions
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- On some subclasses ofP-matrices
- Stair Matrices and Their Generalizations with Applications to Iterative Methods I: A Generalization of the Successive Overrelaxation Method
- Iterative Solution Methods
- On Iterative Computation of Generalized Inverses and Associated Projections
- Homotopic residual correction processes
This page was built for publication: Chebyshev-type methods and preconditioning techniques
