A Third Order Fast Sweeping Method with Linear Computational Complexity for Eikonal Equations

Fast sweeping methods are a class of efficient iterative methods for solving steady state hyperbolic PDEs. They utilize the Gauss-Seidel iterations and alternating sweeping strategy to cover a family of characteristics of the hyperbolic PDEs in a certain direction simultaneously in each sweeping ord...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of scientific computing Ročník 62; číslo 1; s. 198 - 229
Hlavní autoři:	Wu, Liang, Zhang, Yong-Tao
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.01.2015 Springer Nature B.V
Témata:	Accuracy Algorithms Causality Complexity Computation Computational grids Computational Mathematics and Numerical Analysis Computing costs Design Eikonal equation Hyperbolic differential equations Information flow Iterative methods Mathematical analysis Mathematical and Computational Engineering Mathematical and Computational Physics Mathematical models Mathematics Mathematics and Statistics Methods Nonlinear systems Numerical analysis Partial differential equations Solvers Sweeping Theoretical Linear computational complexity Eikonal equations Discontinuous Galerkin methods Static Hamilton–Jacobi equations High order accuracy 65M99 Fast sweeping methods
ISSN:	0885-7474, 1573-7691
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!