Write in a clean editor, then format for Numerical Linear Algebra with Applications in one click — DocuGuru applies the official Wiley template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Numerical Linear Algebra with Applications is a peer-reviewed journal published by Wiley, covering Matrix Theory and Algorithms, Advanced Numerical Methods in Computational Mathematics, Electromagnetic Scattering and Analysis.
| Publisher | Wiley |
|---|---|
| Reference style | Author–year (Chicago) Author–year — (Smith, 2023) in the text Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." Numerical Linear Algebra with Applications 12 (3): 45–58.
Formats any DOI in Numerical Linear Algebra with Applications style. No sign-up. |
| Publishes research in | Matrix Theory and Algorithms Advanced Numerical Methods in Computational Mathematics Electromagnetic Scattering and Analysis Advanced Optimization Algorithms Research Numerical methods for differential equations |
| ISSN | 1070-5325 |
| Citation impact (2-yr) | 1 |
| h-index | 76 |
| i10-index | 787 |
| Total citations | 33,813 |
| Article processing charge | $4,430 |
| Top institutions publishing here | Lawrence Livermore National Laboratory |
| Journal website | onlinelibrary.wiley.com |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Abstract In this paper we describe an Incomplete LU factorization technique based on a strategy which combines two heuristics. This ILUT factorization extends the usual ILU(O) factorization without using the concept of level of fill‐in. There are two traditional ways of developing incomplete factorization preconditioners. The first uses a symbolic factorization approach in which a…
Abstract Many advances in the development of Krylov subspace methods for the iterative solution of linear systems during the last decade and a half are reviewed. These new developments include different versions of restarted, augmented, deflated, flexible, nested, and inexact methods. Also reviewed are methods specifically tailored to systems with special properties such as special…
For the large sparse linear complementarity problems, by reformulating them as implicit fixed-point equations based on splittings of the system matrices, we establish a class of modulus-based matrix splitting iteration methods and prove their convergence when the system matrices are positive-definite matrices and H+-matrices. These results naturally present convergence conditions for the symmetric positive-definite matrices…
Abstract We study large‐scale, continuous‐time linear time‐invariant control systems with a sparse or structured state matrix and a relatively small number of inputs and outputs. The main contributions of this paper are numerical algorithms for the solution of large algebraic Lyapunov and Riccati equations and linear‐quadratic optimal control problems, which arise from such systems. First,…
We blend dual and primal domain decomposition approaches to construct a fast iterative method for the solution of large-scale systems of equations arising from the finite element discretization of second- and fourth-order partial differential equations. We show numerically that our method is scalable with respect to the mesh size, the subdomain size, and the number…
