Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement

DOI10.1007/S12190-018-01229-8MaRDI QIDQ2318331zbMATH OpenOpenAlexWikidataFDO

Authors Alexander Stotsky

Publication date 14 August 2019

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://research.chalmers.se/en/publication/33a8fdf6-0803-45e4-8a58-88b27a793f11

zbMATH Keywords

least squares estimationill-conditioned matrixNeumann seriespolynomial preconditioningRichardson iterationstrictly diagonally dominant matrixsymmetric positive definite matrixcomputationally efficient matrix inversion algorithmharmonic regressorhigh order Newton-Schulz algorithmmatrix power series factorizationsimultaneous calculations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• New unifying convergence criteria for Newton-like methods
• A Unified Framework for the Construction of Higher-order Methods for Nonlinear Equations~!2009-10-14~!2010-01-13~!2010-04-14~!
• scientific article; zbMATH DE number 1864525
• Accelerating the convergence of Newton-type iterations
• A unified framework for high-order numerical discretizations of variational inequalities
• scientific article; zbMATH DE number 7163164
• scientific article; zbMATH DE number 1890889
• A unified approach for enlarging the radius of convergence for Newton's method and applications
• A unified framework for the design of efficient fourth order Newton-like methods
• A unified approach for constructing fast two-step Newton-like methods

Cites work

• scientific article; zbMATH DE number 2086144 (Why is no real title available?)
• scientific article; zbMATH DE number 3997615 (Why is no real title available?)
• scientific article; zbMATH DE number 3269388 (Why is no real title available?)
• A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
• A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
• A fourth-order iterative method for computing the Moore-Penrose inverse
• A general theory of linear time-invariant adaptive feedforward systems with harmonic regressors
• A geometrical approach on generalized inverses by Neumann-type series
• A higher order iterative method for \(A^{(2)}_{T,S}\)
• A new method for solving ill-conditioned linear systems
• A parallel iterative system solver
• An efficient parallel solver for SDD linear systems
• Approximating the inverse of a matrix for use in iterative algorithms on vector processors
• Iterative solution of large sparse systems of equations. Transl. from the German
• Matrix Analysis
• Matrix Preconditioning Techniques and Applications
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• On a Class of High Order Methods for Inverting Matrices
• Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
• Preconditioning techniques for large linear systems: A survey
• Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems
• Variations on Richardson's method and acceleration
• Yet another polynomial preconditioner for the conjugate gradient algorithm

This page was built for publication: Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318331)