Results 31 to 40 of about 22,526 (213)
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
A numerical algorithm for constructing polynomials deviating least from zero with a given weight
St. Petersburg Polytechnical University Journal: Physics and Mathematics, 2023 The article considers numerical algorithms for determining the coefficients of polynomials with a fixed leading coefficient, the algorithms supplying a minimum deviation from zero in a minimax norm with a given weight function. The polynomials serve as a
Berdnikov Alexander, Solovyev Konstantin
doaj +1 more source
Two Aspects of Black hole entropy in Lanczos-Lovelock models of gravity [PDF]
, 2012 We consider two specific approaches to evaluate the black hole entropy which are known to produce correct results in the case of Einstein's theory and generalize them to Lanczos-Lovelock models.
Kolekar, Sanved +2 more
core +2 more sources
On computing the minimum singular value of a tensor sum
Special Matrices, 2019 Recently, the Lanczos bidiagonalization method over tensor space has been proposed for computing the maximum and minimum singular values of a tensor sum T.
Ohashi A., Sogabe T.
doaj +1 more source
, 2010 The overlap operator in lattice QCD requires the computation of the sign function of a matrix, which is non-Hermitian in the presence of a quark chemical potential. In previous work we introduced an Arnoldi-based Krylov subspace approximation, which uses
Andreas Frommer +36 more
core +1 more source
The Short-Term Rational Lanczos Method and Applications
SIAM Journal on Scientific Computing, 2022 Rational Krylov subspaces have become a reference tool in dimension reduction procedures for several application problems. When data matrices are symmetric, a short-term recurrence can be used to generate an associated orthonormal basis. In the past this procedure was abandoned because it requires twice the number of linear system solves per iteration ...
Palitta, Davide +2 more
openaire +4 more sources
A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform
Modelling and Simulation in Engineering, 2017 An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT-Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images.
Srinivas Koppu, V. Madhu Viswanatham
doaj +1 more source
BFGS method based variable projection approach for image restoration
IET Image Processing, 2021 In this paper, a variable projection approach based on the BFGS (Broyden–Fletcher–Goldfarb–Shanno) method for image reconstruction problems is proposed, which is an alternative to the common alternating minimisation scheme.
Qiong‐Ying Chen +4 more
doaj +1 more source
Numerical Algorithms for Computing an Arbitrary Singular Value of a Tensor Sum
Axioms, 2021 We consider computing an arbitrary singular value of a tensor sum: T:=In⊗Im⊗A+In⊗B⊗Iℓ+C⊗Im⊗Iℓ∈Rℓmn×ℓmn, where A∈Rℓ×ℓ, B∈Rm×m, C∈Rn×n. We focus on the shift-and-invert Lanczos method, which solves a shift-and-invert eigenvalue problem of (TTT−σ˜2Iℓmn)−1 ...
Asuka Ohashi, Tomohiro Sogabe
doaj +1 more source
Maximum Entropy Approach to Massive Graph Spectrum Learning with Applications
Algorithms, 2022 We propose an alternative maximum entropy approach to learning the spectra of massive graphs. In contrast to state-of-the-art Lanczos algorithm for spectral density estimation and applications thereof, our approach does not require kernel smoothing.
Diego Granziol +5 more
doaj +1 more source