Chebyshev-type methods and preconditioning techniques
From MaRDI portal
Recommendations
- APPLICATION OF A PRECONDITIONING ITERATIVE METHOD TO THE COMPUTATION OF FLUID FLOW
- Restrictively preconditioned Chebyshev method for solving systems of linear equations
- The superiority of a new type (2,2)-step iterative method over the related Chebyshev method
- Approximation of inverse operators by a new family of high-order iterative methods.
- scientific article; zbMATH DE number 176175
Cites work
- scientific article; zbMATH DE number 3488494 (Why is no real title available?)
- scientific article; zbMATH DE number 2098233 (Why is no real title available?)
- scientific article; zbMATH DE number 3302871 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A geometric construction of iterative functions of order three to solve nonlinear equations
- A modified Chebyshev's iterative method with at least sixth order of convergence
- A new scheme of computing the approximate inverse preconditioner for the reduced linear systems
- A note on a modification of Moser's method
- A note on computational algorithm for the inverse of a square matrix
- Additive preconditioning and aggregation in matrix computations
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- An improvement on a new upper bound for moduli of eigenvalues of iterative matrices
- Approximate iterations for structured matrices
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- Block ILU factorization preconditioners for a block-tridiagonal \(H\)-matrix
- Comparisons of weak regular splittings and multisplitting methods
- Computational algorithms for computing the inverse of a square matrix, quasi-inverse of a non-square matrix and block matrices
- Geometric constructions of iterative functions to solve nonlinear equations
- Homotopic residual correction processes
- Iterative Solution Methods
- Navier-Stokes calculations with a coupled strongly implicit method. I. Finite-difference solutions
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
- Newton-like iteration based on a cubic polynomial for structured matrices
- On Iterative Computation of Generalized Inverses and Associated Projections
- On a Newton-Moser type method
- On a new criterion for the H-matrix property
- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
- On some subclasses ofP-matrices
- On the diagonal approximation of full matrices
- Singularity, Wielandt's Lemma and singular values
- Stair Matrices and Their Generalizations with Applications to Iterative Methods I: A Generalization of the Successive Overrelaxation Method
- The Ulm method under mild differentiability conditions
- Third-order iterative methods under Kantorovich conditions
Cited in
(40)- Approximation of inverse operators by a new family of high-order iterative methods.
- Solving fourth order differential equations using particular solutions of Helmholtz-type equations
- An improved computationally efficient method for finding the Drazin inverse
- The LMAPS for solving fourth-order PDEs with polynomial basis functions
- A high-order iterate method for computing \(A_{T, S}^{(2)}\)
- Factorizations of hyperpower family of iterative methods via least squares approach
- Inverse matrix estimations by iterative methods with weight functions and their stability analysis
- The MAPS based on trigonometric basis functions for solving elliptic partial differential equations with variable coefficients and Cauchy-Navier equations
- An efficient MAPS for solving fourth order partial differential equations using trigonometric functions
- The LMAPS using polynomial basis functions for near-singular problems
- A new iterative method for finding approximate inverses of complex matrices
- Representation learning on unit ball with 3D roto-translational equivariance
- Local RBF algorithms for elliptic boundary value problems in annular domains
- An efficient method to compute the Moore-Penrose inverse
- Finding the Moore-Penrose inverse by a new matrix iteration
- The method of particular solutions for solving nonlinear Poisson problems
- On finding robust approximate inverses for large sparse matrices
- Exploiting higher computational efficiency index for computing outer generalized inverses
- Preconditioning on high-order element methods using Chebyshev-Gauss-Lobatto nodes
- A rapid numerical algorithm to compute matrix inversion
- 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
- An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
- Localized meshless methods based on polynomial basis functions for solving axisymmetric equations
- An efficient matrix iterative method for computing Moore-Penrose inverse
- 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)}}\)
- A Preconditioning Matrix for the Chebyshev Differencing Operator
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- An efficient matrix iteration family for finding the generalized outer inverse
- A general class of arbitrary order iterative methods for computing generalized inverses
- Parallel solution of large narrow band linear systems
- Finding generalized inverses by a fast and efficient numerical method
- A new iterative method to find the Moore-Penrose inverse
- A fast convergent iterative solver for approximate inverse of matrices
- A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis
- A novel iterative method to find the Moore-Penrose inverse of a tensor with Einstein product
- An efficient computation of generalized inverse of a matrix
- New iterative procedures for approximating different types of inverse matrix: convergence and stability
This page was built for publication: Chebyshev-type methods and preconditioning techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q720610)
