Pith. sign in

REVIEW 1 cited by

A Survey on Intelligent Iterative Methods for Solving Sparse Linear Algebraic Equations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.06630 v1 pith:6CXO6NIA submitted 2023-10-10 math.NA cs.NA

A Survey on Intelligent Iterative Methods for Solving Sparse Linear Algebraic Equations

classification math.NA cs.NA
keywords methodsiterativeaspectequationsintelligentlinearsparsealgebraic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Efficiently solving sparse linear algebraic equations is an important research topic of numerical simulation. Commonly used approaches include direct methods and iterative methods. Compared with the direct methods, the iterative methods have lower computational complexity and memory consumption, and are thus often used to solve large-scale sparse linear equations. However, there are numerous iterative methods, parameters and components needed to be carefully chosen, and an inappropriate combination may eventually lead to an inefficient solution process in practice. With the development of deep learning, intelligent iterative methods become popular in these years, which can intelligently make a sufficiently good combination, optimize the parameters and components in accordance with the properties of the input matrix. This survey then reviews these intelligent iterative methods. To be clearer, we shall divide our discussion into three aspects: a method aspect, a component aspect and a parameter aspect. Moreover, we summarize the existing work and propose potential research directions that may deserve a deep investigation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Self-Supervised Learning for Sparse Matrix Reordering

    cs.LG 2026-05 unverdicted novelty 7.0

    A self-supervised multigrid graph network with triplet sampling from the Fill-Path Theorem and an end-max chain loss reduces fill-ins and speeds up LU factorization on SuiteSparse matrices.