Results 81 to 90 of about 16,479 (201)
Concepts in Magnetic Resonance Part A, Volume 2026, Issue 1, 2026.Resting‐state functional MRI (rsfMRI) analysis relies on complex mathematical operations whose properties and pitfalls are often poorly understood, leading to interpretational errors and suboptimal processing choices. This work presents novel mathematical insights for rsfMRI analysis through three key contributions: (1) a unified geometric framework ...
Chisondi S. Warioba, Gianluigi Veglia
wiley +1 more source
Structural Control and Health Monitoring, Volume 2026, Issue 1, 2026.Bearings are critical components of bridges and are susceptible to various forms of deterioration under the action of traffic loads and complex environmental conditions. Existing methods for assessing the condition of bearings, including visual inspections, force sensors, cameras, and vibration sensors, still present challenges in accurately locating ...
Chuang Wang +7 more
wiley +1 more source
An optimized Lanczos Tau-method
St. Petersburg Polytechnical University Journal: Physics and MathematicsThe paper puts forward an effective algorithm for producing approximate polynomial solutions for linear ordinary differential equations (LODEs) and sets of LODEs with polynomial coefficients and polynomial right-hand side functions.
Bulyanitsa Anton +2 more
doaj +1 more source
How to Make the Lanczos Algorithm Converge Slowly [PDF]
Mathematics of Computation, 1979 The Paige style Lanczos algorithm is an iterative method for finding a few eigenvalues of large sparse symmetric matrices. Some beautiful relationships among the elements of the eigenvectors of a symmetric tridiagonal matrix are used to derive a perverse starting vector which delays convergence as long as possible.
openaire +1 more source
International Journal for Numerical Methods in Engineering, Volume 126, Issue 24, 30 December 2025.ABSTRACT Eigenvalue and eigenvector sensitivities with respect to design parameters are crucial for advancing design, optimization, and uncertainty quantification in structural systems. This paper introduces a novel, efficient, and general numerical method for computing arbitrary‐order sensitivities of eigenpairs in self‐adjoint undamped and ...
Juan C. Velasquez‐Gonzalez +4 more
wiley +1 more source
A biconjugate gradient type algorithm on massively parallel architectures [PDF]
The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems.
Freund, Roland W., Hochbruck, Marlis
core +1 more source
Accelerated filtering on graphs using Lanczos method [PDF]
, 2015 Signal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames constructed from graphs, like wavelets on graphs, has substantially increased.
Kressner, Daniel +3 more
core +1 more source
Krylov complexity in the Schrödinger field theory
Journal of High Energy PhysicsWe investigate the Krylov complexity of Schrödinger field theories, focusing on both bosonic and fermionic systems within the grand canonical ensemble which includes a chemical potential.
Peng-Zhang He, Hai-Qing Zhang
doaj +1 more source
Measurement-efficient quantum Krylov subspace diagonalisation [PDF]
QuantumThe Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing.
Zongkang Zhang +3 more
doaj +1 more source
Approximation of the scattering amplitude [PDF]
, 2007 The simultaneous solution of Ax=b and ATy=g is required in a number of situations. Darmofal and Lu have proposed a method based on the Quasi-Minimal residual algorithm (QMR). We will introduce a technique for the same purpose based on the LSQR method and
Golub, Gene H. +2 more
core +2 more sources