An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
From MaRDI portal
Publication:3359648
DOI10.1137/0912058zbMath0733.65023OpenAlexW2073998620MaRDI QIDQ3359648
Robert Schreiber, Pan, Victor Y.
Publication date: 1991
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2060/19920002505
stabilitycomparison of methodssingular value decompositionparallel computingpseudoinversesignal processingMoore-Penrose generalized inverseKogbetliantz methodNewton-Schulz iterationChebyshev accelerationGolub/Reinsch-method
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10)
Related Items
Exploiting higher computational efficiency index for computing outer generalized inverses, A two-step iterative method and its acceleration for outer inverses, Approximate Inverse Preconditioners for the Conjugate Gradient Method, An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse, Schur aggregation for linear systems and determinants, Structured matrices and Newton's iteration: unified approach, Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices, An efficient matrix iteration family for finding the generalized outer inverse, Newton-like method for nonlinear banded block diagonal system, A new scheme of computing the approximate inverse preconditioner for the reduced linear systems, On finding robust approximate inverses for large sparse matrices, Iterative inversion of structured matrices, Convergence analysis of Newton method without inversion for solving discrete algebraic Riccati equations, A self-correcting matrix iteration for the Moore-Penrose generalized inverse, Sparse solution of the Lyapunov equation for large-scale interconnected systems, A fast computational algorithm for computing outer pseudo-inverses with numerical experiments, From Zhang neural network to scaled hyperpower iterations, Iterative method for computing the Moore-Penrose inverse based on Penrose equations, Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks, A family of iterative methods with accelerated convergence for restricted linear system of equations, Computing outer inverses by scaled matrix iterations, GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications, A continuation method for solving symmetric Toeplitz systems, Modified SMS method for computing outer inverses of Toeplitz matrices, Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs, A new iterative method for finding approximate inverses of complex matrices, An efficient matrix iterative method for computing Moore-Penrose inverse, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Root-finding by expansion with independent constraints, Hybrid Ikebe-Newton's iteration for inverting general nonsingular Hessenberg matrices, An efficient computation of generalized inverse of a matrix, Homotopic residual correction processes, An efficient matrix iteration for computing weighted Moore-Penrose inverse, An efficient method to compute the Moore-Penrose inverse, Factorizations of hyperpower family of iterative methods via least squares approach, A fast, preconditioned conjugate gradient Toeplitz solver, Randomized preprocessing of homogeneous linear systems of equations, Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration, An improved algorithm for basis pursuit problem and its applications, An improved Newton iteration for the weighted Moore-Penrose inverse, Newton-like iteration based on a cubic polynomial for structured matrices, A rapid numerical algorithm to compute matrix inversion, Chebyshev-type methods and preconditioning techniques, Gauss-Newton-type methods for bilevel optimization, Schultz matrix iteration based method for stable solution of discrete ill-posed problems, Superfast solution of linear convolutional Volterra equations using QTT approximation, New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration, 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, Fast and efficient parallel solution of dense linear systems, Displacement structure of weighted pseudoinverses, A fast convergent iterative solver for approximate inverse of matrices, A class of quadratically convergent iterative methods, Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\), Finding the Moore-Penrose inverse by a new matrix iteration, Stabilized BFGS approximate Kalman filter, An efficient and stable Newton-type iterative method for computing generalized inverse \(A_{T,S}^{(2)}\)
Uses Software
