Results 21 to 30 of about 78,319 (219)
S-Step BiCGStab Algorithms for Geoscience Dynamic Simulations
In basin and reservoir simulations, the most expensive and time consuming phase is solving systems of linear equations using Krylov subspace methods such as BiCGStab.
Anciaux-Sedrakian Ani +3 more
doaj +1 more source
Partitioned Quantum Subspace Expansion [PDF]
We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states.
Tom O'Leary +3 more
doaj +1 more source
Compact models for wireless systems [PDF]
For the design and analysis of wireless systems, complex simulations are required and performed. Model order reduction techniques enable greater efficiencies to be achieved and concomitantly, a reduction in memory-resource usage. However, maintaining a
Condon, Marissa, Grahovski, Georgi G.
core +2 more sources
Newton-Krylov Type Algorithm for Solving Nonlinear Least Squares Problems
The minimization of a quadratic function within an ellipsoidal trust region is an important subproblem for many nonlinear programming algorithms. When the number of variables is large, one of the most widely used strategies is to project the original ...
Mohammedi R. Abdel-Aziz +1 more
doaj +1 more source
This paper presents an analysis of the time complexity of algorithms prepared for solving heat transfer problems at nanoscale. The first algorithm uses the classic Dual-Phase-Lag model, whereas the second algorithm employs a reduced version of the model ...
Tomasz Raszkowski, Mariusz Zubert
doaj +1 more source
On skew-Hamiltonian matrices and their Krylov-Lagrangian subspaces [PDF]
It is a well-known fact that the Krylov space $\mathcal{K}_j(H,x)$ generated by a skew-Hamiltonian matrix $H \in \mathbb{R}^{2n \times 2n}$ and some $x \in \mathbb{R}^{2n}$ is isotropic for any $j \in \mathbb{N}$. For any given isotropic subspace $\mathcal{L} \subset \mathbb{R}^{2n}$ of dimension $n$ - which is called a Lagrangian subspace - the ...
Philip Saltenberger, Michel-Niklas Senn
openaire +2 more sources
LeXInt: Package for exponential integrators employing Leja interpolation
We present a publicly available software for exponential integrators that computes the φl(z)functions using polynomial interpolation. The interpolation method at Leja points have recently been shown to be competitive with the traditionally-used Krylov ...
Pranab J. Deka +2 more
doaj +1 more source
Krylov Subspace Recycling For Matrix Functions
22 pages, 5 ...
Liam Burke 0002 +3 more
openaire +2 more sources
Sampling Error Analysis in Quantum Krylov Subspace Diagonalization [PDF]
Quantum Krylov subspace diagonalization (QKSD) is an emerging method used in place of quantum phase estimation in the early fault-tolerant era, where limited quantum circuit depth is available. In contrast to the classical Krylov subspace diagonalization
Gwonhak Lee, Dongkeun Lee, Joonsuk Huh
doaj +1 more source
Uzawa Algorithms for Fully Fuzzy Linear Systems
Recently, there have been many studies on solving different kinds of fuzzy equations. In this paper, the solution of a trapezoidal fully fuzzy linear system (FFLS) is studied.
H. Zareamoghaddam +3 more
doaj +1 more source

