Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 22 for “"Krylov subspaces"”.
-
Recycling Krylov Subspaces and Preconditioners
… systems. We develop algorithms that recycle Krylov subspaces and preconditioners from one system (or pair of systems) in the sequence to the next, leading to efficient solutions. Besides the benefit of only having to store few Lanczos vectors, using BiConjugate Gradients (BiCG) to solve dual …
-
At the intersection of differential equations and optimization: inverse problems, path planning and Krylov subspaces
… chapter presents a practical framework to apply Krylov subspace methods to differential operators.
-
Novel iterative methods for solving matrix equations arising from partial differential equations
… equations can be solved using a rational Krylov approach, where orthonormal bases of rational Krylov subspaces are used to project the matrix equations. The projected matrix equation is then solved, and a low rank solution is computed. As part of the generation of the orthonormal basis, …
-
A multigrid Krylov method for eigenvalue problems.
… methods for eigenvalue problems based on Krylov subspaces. Multigrid methods solve differential equations by taking advantage of the hierarchy of discretizations. A multigrid Krylov method is proposed by combining Arnoldi and multigrid methods. We compare the new approach with other …
-
Low-rank solution methods for large-scale linear matrix equations
… methods based on standard, extended and rational Krylov subspaces to solve equations which may viewed as extensions of the classical Lyapunov and Sylvester equations. The first class of matrix equations that we consider are constrained Sylvester equations, which essentially consist of Sylvester's …
-
Kernels: Regularization and Optimization
… are iterative methods that generate solutions in Krylov subspaces, and exhibit semi-convergence. We analyse the sequence of Krylov subspaces that determine the associated filter function on the spectrum of the inverse problem, and quantitatively investigate semi-convergence. These algorithms are …
-
Three Dimensional Pseudospectral Self -Consistent Field Approximation
… is used. The full-size problem is projected onto Krylov subspaces of limited size with an explicitly orthogonalized basis. The smaller-size projected problem is solved using LAPACK library functions and then the solution is transformed back to the original space. In Arnoldi's method, vectors in …
-
Krylov Projection Methods for Model Reduction
… dynamic systems. Projections onto unions of Krylov subspaces lead to a class of reduced-order models known as rational interpolants. The cornerstone of this dissertation is a collection of theory relating Krylov projection to rational interpolation. Based on this theoretical framework, three …
-
On the Use of Arnoldi and Golub-Kahan Bases to Solve Nonsymmetric Ill-Posed Inverse Problems
Iterative Krylov subspace methods have proven to be efficient tools for solving linear systems of equations. In the context of ill-posed inverse problems, they tend to exhibit semiconvergence behavior making it difficult detect ``inverted noise" and stop iterations before solutions become …
-
The Buffered Block Forward Backward technique for solving electromagnetic wave scattering problems
… more effective than classical methods based on Krylov subspaces for example. A possible application of the BBFB, namely the design of 2D dielectric photonic band-gap TeraHertz waveguides is investigated. ii
-
Robust adaptive machine learning algorithms for distributed signal processing
… the estimates to lie within lower dimensional Krylov subspaces. The derived schemes serve a good trade-off between complexity/bandwidth demands and achieved performance.
-
Computations and Analysis with Non-normal Matrices
… x_k, k = 1, 2, . . ., from successive Krylov subspaces, span{b, Ab, . . . , A^(k−1)b}, that minimize the 2-norm of the residual, ∥D(A)x_k −N(A)b∥_2 . Convergence of the Arnoldi-OR algorithm can be bounded based on the eigenvalues of A and the condition number of the best-conditioned …
-
Improving Efficiency of Rational Krylov Subspace Methods
… These problems are solved by rational Krylov subspace methods (RKSM). We present several improvements in two directions: pole selection and applying inexact methods. In Chapter 3, a flexible extended Krylov subspace method ($\mathcal{F}$-EKSM) is considered for numerical approximation …
-
A Scalable and Flexible Framework for Gaussian Processes via Matrix-Vector Multiplication
Gaussian processes (GPs) exhibit a classic tension of many machine learning methods: they possess desirable modelling capabilities yet suffer from important practical limitations. In many instances, GPs are able to offer well-calibrated uncertainty estimates, interpretable predictions, and the …
-
High-degree polynomial noise subtraction and Multipolynomial Monte Carlo trace estimation in Lattice QCD.
In lattice Quantum Chromodynamics, the determination of physical quantities containing disconnected loop effects is very computationally expensive. For this reason, the trace of the inverted Wilson-Dirac matrix required for such measurements are performed stochastically through Monte Carlo methods. …
-
Some Results on the Convergence of Anderson Acceleration
Anderson acceleration (AA), also known as Anderson mixing, is an extrapolation technique used to accelerate the convergence of fixed-point iterations $\bm{x}_{k+1}=\bm{q}(\bm{x}_k)$, $k=0,1,\dots$, with $\bm{q}:\R^n\to\R^n$, $\bm{x}_k\in\R^n$. AA was first introduced by D.G. Anderson in the context …
-
Compact models for nanophotonic structures and on -chip interconnects
… frequencies. The proposed methods are based on Krylov subspace method with interpolation points dynamically selected using either spline based algorithm or discrete wavelet transform. Narrow and wideband frequency projection are also achieved using spectral zeros by applying either a frequency …
-
NI-GMRES precondicionado
… família dos métodos de projeção em subespaços de Krylov. Afim de evitar de evitar o acréscimo no custo computacional devido ao aumento a cada iteração na dimensão do subespaço de Krylov utilizamos o GMRES com recomeços ou GMRES(m), o qual pode apresentar problemas de estagnação (duas soluções …
Page 1 of 2