Related papers: Computing eigenfunctions and eigenvalues of bounda…
We introduce an efficient boundary-adapted spectral method for peridynamic diffusion problems with arbitrary boundary conditions. The spectral approach transforms the convolution integral in the peridynamic formulation into a multiplication…
We present an algorithm for the calculation of eigenstates with definite linear momentum in quantum lattices. Our method is related to the Density Matrix Renormalization Group, and makes use of the distribution of multipartite entanglement…
We apply pseudo-spectral methods to construct global solutions of functional renormalisation group equations in field space to high accuracy. For this, we introduce a basis to resolve both finite as well as asymptotic regions of effective…
Employing the phase-space representation of second order ordinary differential equations we developed a method to find the eigenvalues and eigenfunctions of the 1-dimensional time independent Schr\"odinger equation for quantum model…
We compare two established and a new method for the calculation of spectral bounds for Hessian matrices on hyperrectangles by applying them to a large collection of 1522 objective and constraint functions extracted from benchmark global…
In this paper, we propose a subspace method based on neural networks for eigenvalue problems with high accuracy and low cost. We first construct a neural network-based orthogonal basis by some deep learning method and dimensionality…
We present two approximation methods for computing eigenfrequencies and eigenmodes of large-scale nonlinear eigenvalue problems resulting from boundary element method (BEM) solutions of some types of acoustic eigenvalue problems in…
We present an algorithm based on numerical techniques that have become standard for solving nonlinear integral equations: Newton's method, homotopy continuation, the multilevel method and random projection to solve the inversion problem…
A wide range of problems in computational science and engineering require estimation of sparse eigenvectors for high dimensional systems. Here, we propose two variants of the Truncated Orthogonal Iteration to compute multiple leading…
Generalizing methods developed by Pinn, Pordt and Wieczerkowski for the hierarchical model with one component (N=1) and dimensions d between 2 and 4 we compute O(N)-symmetric fixed points of the hierarchical renormalization group equation…
We propose a new approach for the image super-resolution (SR) task that progressively restores a high-resolution (HR) image from an input low-resolution (LR) image on the basis of a neural ordinary differential equation. In particular, we…
This paper presents a two-stage online algorithm for recovery of low-rank parameter matrix in non-stationary stochastic systems. The first stage applies the recursive least squares (RLS) estimator combined with its singular value…
We present a refinement of the Spectral Method by incorporating an optimization method into it and generalize it to two space dimensions. We then apply this Refined Spectral Method as an extremely accurate technique for finding the bound…
This paper is to introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary…
This article deals with the efficient and certified numerical approximation of the smallest eigenvalue and the associated eigenspace of a large-scale parametric Hermitian matrix. For this aim, we rely on projection-based model order…
The recently developed data-driven eigenmatrix method shows very promising reconstruction accuracy in sparse recovery for a wide range of kernel functions and random sample locations. However, its current implementation can lead to…
We continue the presentation of the pragmatic mode-sum regularization (PMR) method for computing the renormalized stress-energy tensor (RSET). We show in detail how to employ the $t$-splitting variant of the method, which was first…
Based on the Taylor expansion, we propose a renormalization method for asymptotic analysis. The standard renormalization group (RG) method for asymptotic analysis can be derived out from this new method, and hence the mathematical essence…
Numerical simulation of ordinary differential equations (ODEs) can be challenging when the system exhibits high accelerations and rapidly changing dynamics. Under these conditions the ODE solver often needs to take very small time steps in…
Ordinary differential equations (ODEs) are widely used to describe the time evolution of natural phenomena across various scientific fields. Estimating the parameters of these systems from data is a challenging task, particularly when…