Related papers: Fast eigenpairs computation with operator adapted …
This paper is concerned with the development and analysis of an iterative solver for high-dimensional second-order elliptic problems based on subspace-based low-rank tensor formats. Both the subspaces giving rise to low-rank approximations…
In this paper we propose a new iterative method to hierarchically compute a relatively large number of leftmost eigenpairs of a sparse symmetric positive matrix under the multiresolution operator compression framework. We exploit the…
We propose a wave operator method to calculate eigenvalues and eigenvectors of large parameter-dependent matrices, using an adaptative active subspace. We consider a hamiltonian which depends on external adjustable or adiabatic parameters,…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
A wide variety of (fixed-point) iterative methods for the solution of nonlinear equations (in Hilbert spaces) exists. In many cases, such schemes can be interpreted as iterative local linearization methods, which, as will be shown, can be…
We investigate a class of parametric elliptic eigenvalue problems with homogeneous essential boundary conditions where the coefficients (and hence the solution $u$) may depend on a parameter $y$. For the efficient approximate evaluation of…
A family of interior penalty $hp$-discontinuous Galerkin methods is developed and analyzed for the numerical solution of the quasilinear elliptic equation $-\nabla{} \cdot (\mathbf{A}(\nabla{u}) \nabla{u} = f$ posed on the open bounded…
Positive linear programs (LPs) model many graph and operations research problems. One can solve for a $(1+\epsilon)$-approximation for positive LPs, for any selected $\epsilon$, in polylogarithmic depth and near-linear work via variations…
In this paper, we propose an adaptive finite element method for computing the first eigenpair of the $p$-Laplacian problem. We prove that starting from a fine initial mesh our proposed adaptive algorithm produces a sequence of discrete…
We present a high-order spacetime numerical method for discretizing and solving linear initial-boundary value problems using wavelet-based techniques with user-prescribed error estimates. The spacetime wavelet discretization yields a system…
In this paper we focus on nonparametric estimators in inverse problems for Poisson processes involving the use of wavelet decompositions. Adopting an adaptive wavelet Galerkin discretization, we find that our method combines the well-known…
The eigenmodes of resonating structures, e.g., electromagnetic cavities, are sensitive to deformations of their shape. In order to compute the sensitivities of the eigenpair with respect to a scalar parameter, we state the Laplacian and…
We present weighted quadrature for hierarchical B-splines to address the fast formation of system matrices arising from adaptive isogeometric Galerkin methods with suitably graded hierarchical meshes. By exploiting a local tensor-product…
The overall goal of this dissertation is to investigate certain classical results from harmonic analysis, replacing the Euclidean setting, the abelian structure and the elliptic Laplace operator with a non-commutative environment and…
In this paper, we focus on solving a sequence of linear systems with an identical (or similar) coefficient matrix. For this type of problems, we investigate the subspace correction and deflation methods, which use an auxiliary matrix…
The power method is a basic method for computing the dominant eigenpair of a matrix. In this paper, we propose a structure-preserving power-like method for computing the dominant conjugate pair of purely imaginary eigenvalues and the…
We show how to speed up the computation of isomorphisms of hyperelliptic curves by using covariants. We also obtain new theoretical and practical results concerning models of these curves over their field of moduli.
This article studies the recovery of graphons when they are convolution kernels on compact (symmetric) metric spaces. This case is of particular interest since it covers the situation where the probability of an edge depends only on some…
In this article, we present Bembel, the C++ library featuring higher order isogeometric Galerkin boundary element methods for Laplace, Helmholtz, and Maxwell problems. Bembel is compatible with geometries from the Octave NURBS package and…
We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…