On the Performance of Tensor Methods for Solving Ill-Conditioned Problems
DOI10.1137/040607745zbMATH Open1154.65329OpenAlexW2005162476MaRDI QIDQ3545247FDOQ3545247
Authors: Brett Bader, Robert B. Schnabel
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/
Recommendations
numerical examplesnonlinear equationsill-conditioned problemslarge-scale systemsNewton's methodsuperlinear convergencesingular problemstensor methodsconditionings
Cited In (5)
- A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- Title not available (Why is that?)
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
Uses Software
This page was built for publication: On the Performance of Tensor Methods for Solving Ill-Conditioned Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545247)