21,458 research outputs found
Multiparameter spectral analysis for aeroelastic instability problems
This paper presents a novel application of multiparameter spectral theory to
the study of structural stability, with particular emphasis on aeroelastic
flutter. Methods of multiparameter analysis allow the development of new
solution algorithms for aeroelastic flutter problems; most significantly, a
direct solver for polynomial problems of arbitrary order and size, something
which has not before been achieved. Two major variants of this direct solver
are presented, and their computational characteristics are compared. Both are
effective for smaller problems arising in reduced-order modelling and
preliminary design optimization. Extensions and improvements to this new
conceptual framework and solution method are then discussed.Comment: 20 pages, 8 figure
Recursive Integral Method with Cayley Transformation
Recently, a non-classical eigenvalue solver, called RIM, was proposed to
compute (all) eigenvalues in a region on the complex plane. Without solving any
eigenvalue problem, it tests if a region contains eigenvalues using an
approximate spectral projection. Regions that contain eigenvalues are
subdivided and tested recursively until eigenvalues are isolated with a
specified precision. This makes RIM an eigensolver distinct from all existing
methods. Furthermore, it requires no a priori spectral information. In this
paper, we propose an improved version of {\bf RIM} for non-Hermitian eigenvalue
problems. Using Cayley transformation and Arnoldi's method, the computation
cost is reduced significantly. Effectiveness and efficiency of the new method
are demonstrated by numerical examples and compared with 'eigs' in Matlab
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets. This paper presents a modular framework for constructing randomized algorithms that compute partial matrix decompositions. These methods use random sampling to identify a subspace that captures most of the action of a matrix. The input matrix is then compressed—either explicitly or
implicitly—to this subspace, and the reduced matrix is manipulated deterministically to obtain the desired low-rank factorization. In many cases, this approach beats its classical competitors in terms of accuracy, robustness, and/or speed. These claims are supported by extensive numerical experiments and a detailed error analysis. The specific benefits of randomized techniques depend on the computational environment. Consider the model problem of finding the k dominant components of the singular value decomposition of an m × n matrix. (i) For a dense input matrix, randomized algorithms require O(mn log(k))
floating-point operations (flops) in contrast to O(mnk) for classical algorithms. (ii) For a sparse input matrix, the flop count matches classical Krylov subspace methods, but the randomized approach is more robust and can easily be reorganized to exploit multiprocessor architectures. (iii) For a matrix that is too large to fit in fast memory, the randomized techniques require only a constant number of passes over the data, as opposed to O(k) passes for classical algorithms. In fact, it is sometimes possible to perform matrix approximation with a single pass over the data
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
Low-rank matrix approximations, such as the truncated singular value
decomposition and the rank-revealing QR decomposition, play a central role in
data analysis and scientific computing. This work surveys and extends recent
research which demonstrates that randomization offers a powerful tool for
performing low-rank matrix approximation. These techniques exploit modern
computational architectures more fully than classical methods and open the
possibility of dealing with truly massive data sets.
This paper presents a modular framework for constructing randomized
algorithms that compute partial matrix decompositions. These methods use random
sampling to identify a subspace that captures most of the action of a matrix.
The input matrix is then compressed---either explicitly or implicitly---to this
subspace, and the reduced matrix is manipulated deterministically to obtain the
desired low-rank factorization. In many cases, this approach beats its
classical competitors in terms of accuracy, speed, and robustness. These claims
are supported by extensive numerical experiments and a detailed error analysis
- …