Related papers: An accurate analytic solution to the Thomas-Fermi …
Applying parallel-in-time algorithms to multiscale Hamiltonian systems to obtain stable long time simulations is very challenging. In this paper, we present novel data-driven methods aimed at improving the standard parareal algorithm…
Analytic continuation of numerical data obtained in imaginary time or frequency has become an essential part of many branches of quantum computational physics. It is, however, an ill-conditioned procedure and thus a hard numerical problem.…
In this paper, we provide an analysis of a recently proposed multicontinuum homogenization technique. The analysis differs from those used in classical homogenization methods for several reasons. First, the cell problems in multicontinuum…
The Homotopy Perturbation Method (HPM) is used to solve the Burgers-Huxley non-linear differential equations. Three case study problems of Burgers-Huxley are solved using the HPM and the exact solutions are obtained. The rapid convergence…
A generalized equation is constructed for a class of classical oscillators with strong anharmonicity which are not exactly solvable. Aboodh transform based homotopy perturbation method (ATHPM) is applied to get the approximate analytical…
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…
An accurate non-gradient-expansion based correction to Thomas--Fermi is developed using solvable model. The used model is a system of $N$ non-interacting electrons moving independently in the Coulomb field of the nuclear charge. The…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimization and nonsmooth analysis. Assuming that resolvents of the operators are available, this problem can be tackled with the Douglas-Rachford…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…
A fast explicit operator splitting (FEOS) method for the molecular beam epitaxy model has been presented in [Cheng, et al., Fast and stable explicit operator splitting methods for phase-field models, J. Comput. Phys., submitted]. The…
This article is concerned with uniform $C^{1,\alpha}$ and $C^{1,1}$ estimates in periodic homogenization of fully nonlinear elliptic equations. The analysis is based on the compactness method, which involves linearization of the operator at…
We introduce a new approach to deriving approximate analytical solutions of a harmonic oscillator damped by purely nonlinear, or combinations of linear and nonlinear damping forces. Our approach is based on choosing a suitable trial…
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…
A new strategy based on numerical homogenization and Bayesian techniques for solving multiscale inverse problems is introduced. We consider a class of elliptic problems which vary at a microscopic scale, and we aim at recovering the highly…
Finding a zero of a maximal monotone operator is fundamental in convex optimization and monotone operator theory, and \emph{proximal point algorithm} (PPA) is a primary method for solving this problem. PPA converges not only globally under…
By splitting a Hamiltonian into two parts, using the solvability of eigenvalue problem of one part of the Hamiltonian, proving a useful identity and deducing an expansion formula of power of operator binomials, we obtain an explicit and…
A numerical method to solve linear integro-differential equations is presented. This method has been used to solve the QCD Altarelli-Parisi evolution equations within the H1 Collaboration at DESY-Hamburg. Mathematical aspects and numerical…
We present a homotopic approach to solving challenging, optimization-based motion planning problems. The approach uses Homotopy Optimization, which, unlike standard continuation methods for solving homotopy problems, solves a sequence of…
We provide a primer to numerical methods based on Taylor series expansions such as generalized finite difference methods and collocation methods. We provide a detailed benchmarking strategy for these methods as well as all data files…