Remarks on polynomial methods for solving systems of linear algebraic equations

zbMATH Open0802.65032MaRDI QIDQ1209417FDOQ1209417

Authors: Krzysztof Moszyński 

Publication date: 16 May 1993

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/15725

Recommendations

• An error-free algorithm to solve a linear system of polynomial equations
• Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
• An algorithm for solving the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s)
• Numerical Solution of Matrix Polynomial Equations by Newton's Method
• Direct methods of solving systems of linear algebraic equations with complex \(\lambda\)-matrices

zbMATH Keywords

numerical examplesRichardson iterationpolynomial methodsFourier expansions

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites Work

• Polynomials by Conformal Mapping for the Richardson Iteration Method for Complex Linear Systems
• Remarks on the lemma of Nersesyan in complex approximation
• Title not available (Why is that?)

Cited In (6)

• The use of Faber polynomials to solve systems of linear equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
• Computing the Roots of Complex Orthogonal and Kernel Polynomials
• A comparison of the monomial method and the S-system method for solving systems of algebraic equations

This page was built for publication: Remarks on polynomial methods for solving systems of linear algebraic equations

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