On the Performance of Tensor Methods for Solving Ill-Conditioned Problems

DOI10.1137/040607745zbMath1154.65329OpenAlexW2005162476MaRDI QIDQ3545247

Robert B. Schnabel, Brett Bader

Publication date: 10 December 2008

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc882054/

zbMATH Keywords

Newton's methodlarge-scale systemsnumerical examplesnonlinear equationssuperlinear convergenceill-conditioned problemssingular problemstensor methodsconditionings

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (2)

Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems ⋮ A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class

Uses Software

• TENSOLVE
• LOCA
• minpack
• MPSalsa

This page was built for publication: On the Performance of Tensor Methods for Solving Ill-Conditioned Problems