Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems (Q5270418): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Using petal-decompositions to build a low stretch spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection method to solve linear systems in tensor format / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to hierarchical matrices with applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Iterative Methods for Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and arithmetics of \(\mathcal H\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Matrices: Algorithms and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaching Optimality for Solving SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly-m log n Time Solver for SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov Subspace Methods for Linear Systems with Tensor Product Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Linear Systems and Matrix Inversion in the TT-Format / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized Kaczmarz algorithm with exponential convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bibliography on semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3613032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4441704 / rank
 
Normal rank

Revision as of 01:12, 14 July 2024

scientific article; zbMATH DE number 6734976
Language Label Description Also known as
English
Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
scientific article; zbMATH DE number 6734976

    Statements

    Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    matrix factorization
    0 references
    linear system
    0 references
    Laplacian matrix
    0 references
    iterative algorithms
    0 references
    sparsity
    0 references
    hierarchical matrices
    0 references
    conjugate gradients
    0 references
    minimal norm solution
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references