Results 111 to 120 of about 5,496,658 (160)

A modified Lanczos Algorithm for fast regularization of extreme learning machines

Neurocomputing, 2020
This paper presents a new regularization for Extreme Learning Machines (ELMs). ELMs are Randomized Neural Networks (RNNs) that are known for their fast training speed and good accuracy.
Amaury Lendasse, Kaj-Mikael Björk, Renjie Hu   +2 more
exaly   +2 more sources

On randomized Lanczos algorithms

Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC '97, 1997
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algorithm that has been used for integer factorization, and to the (provably reliable) algorithm of Wiedemann.
Wayne Eberly, Erich L. Kaltofen
openaire   +1 more source

Nested Lanczos: implicitly restarting an unsymmetric Lanczos algorithm

Numerical Algorithms, 1998
The paper presents a generalization of the concept of implicitly restarting and iterative algorithm to the Lanczos method for eigenvalue problems. It is shown that a full run of the Lanczos algorithm on the small, projected eigenvalue problem generates a biorthogonal factorization for the Lanczos bases.
Gorik De Samblanx, Adhemar Bultheel
openaire   +1 more source

Efficient EM Topology Optimization Incorporating Advanced Matrix Padé Via Lanczos and Genetic Algorithm for Microwave Design

IEEE transactions on microwave theory and techniques, 2021
Electromagnetic (EM) topology optimization aims at finding the optimal shape and topology of the EM structure by adding or eliminating materials, such as metal within the design space.
Jing Jin, F. Feng, Jianan Zhang, Jianguo Ma, Qi-jun Zhang   +4 more
semanticscholar   +1 more source

Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm

Computers and Mathematics With Applications, 2018
Many problems in control theory can be studied by obtaining the symmetric solution of linear matrix equations. In this investigation, we deal with the symmetric solutions X , Y and Z of the general Sylvester matrix equations A 1 X B 1 + C 1 Y D 1 + E 1 Z
Masoud Hajarian
exaly   +2 more sources

A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems

SIAM Journal on Matrix Analysis and Applications, 1994
Horst D Simon, John G Lewis
exaly   +2 more sources

Extension of the Lanczos algorithm for simultaneous computation of multiple targeted singular vector sets

Quarterly Journal of the Royal Meteorological Society, 2019
This article discusses an extension of the singular vector (SV) method in the context of an initial perturbation generator for an ensemble prediction system (EPS). In general, multiple SVs targeted at different regions are computed in operational EPSs to
K. Ono
semanticscholar   +1 more source

Stable model order reduction method for fractional-order systems based on unsymmetric Lanczos algorithm

IEEE/CAA Journal of Automatica Sinica, 2019
This study explores a stable model order reduction method for fractional-order systems. Using the unsymmetric Lanczos algorithm, the reduced order system with a certain number of matched moments is generated.
Zhe Gao
semanticscholar   +1 more source

A combination of the lanczos algorithm with the substructure technique

Journal of Sound and Vibration, 1995
Summary: A modified Lanczos method combined with a substructure technique was used for calculating natural frequencies and mode shapes of large structural systems. The method does not require generation and storage of stiffness and mass matrices of the original structure. It uses only the stiffiness and mass matrices of each substructure.
in-won lee Lee, In Won, gil-ho jung
openaire   +3 more sources

Algorithmic Fault Tolerance Using the Lanczos Method

SIAM Journal on Matrix Analysis and Applications, 1992
The problem of algorithm-based fault tolerance is considered. It is shown how very general sequences of polynomials can be used to generate the checksums, so as to reduce the chance of numerical overflows. Further it is shown how a clever use of the Lanczos algorithm can be applied in the error location and correction steps, so as to save on the amount
Daniel Boley, Richard P. Brent, Gene H. Golub, Franklin T. Luk   +3 more
openaire   +1 more source