2021
DOI: 10.1007/978-3-030-92864-3_7
|View full text |Cite
|
Sign up to set email alerts
|

Greedy Dissection Method for Shared Parallelism in Incomplete Factorization Within INMOST Platform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…At every Newton iteration, the linear system for the update is solved iteratively with the multilevel preconditioner 103,104 . The iterative convergence tolerances are τitalicabs=1012, τitalicrel=1018, dropping tolerances in the second‐order incomplete factorization are τ1=103 and τ2=105, pivoting by condition estimation is κ=2.5.…”
Section: Problem Solutionmentioning
confidence: 99%
“…At every Newton iteration, the linear system for the update is solved iteratively with the multilevel preconditioner 103,104 . The iterative convergence tolerances are τitalicabs=1012, τitalicrel=1018, dropping tolerances in the second‐order incomplete factorization are τ1=103 and τ2=105, pivoting by condition estimation is κ=2.5.…”
Section: Problem Solutionmentioning
confidence: 99%