相关论文: A reliable Pade analytical continuation method bas…
We present a complete prescription for the numerical calculation of surface Green's functions and self-energies of semi-infinite quasi-onedimensional systems. Our work extends the results of Sanvito et al. [1] generating a robust algorithm…
We consider dynamical models given by rational ODE systems. Parameter estimation is an important and challenging task of recovering parameter values from observed data. Recently, a method based on differential algebra and rational…
Fixed-point solvers are ubiquitous in nonlinear PDEs, yet their progress collapses whenever the Jacobian at the solution carries an eigenvalue arbitrarily close to one. We ask whether such stagnation can be removed without storing long…
Smale's alpha-theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to a square polynomial system. The program alphaCertified implements…
Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…
Simulations of finite temperature quantum systems provide imaginary frequency Green's functions that correspond one-to-one to experimentally measurable real-frequency spectral functions. However, due to the bad conditioning of the…
It is shown that the spectral points (bound states and resonances) generated by a central potential of a single-channel problem, can be found using rational parametrization of the S-matrix. To achieve this, one only needs values of the…
We present a massively parallel algorithm for calculating the self-energy in self-consistent finite temperature perturbation theory for lattice models. The algorithm uses analytic functions with appropriate asymptotic high frequency…
A computation scheme for solving elliptic boundary value problems with axially symmetric confining potentials using different sets of one-parameter basis functions is presented. The efficiency of the proposed symbolic-numerical algorithms…
Two-color finite density QCD is free from the sign problem, and it is thus regarded as a good model to check the validity of the analytic continuation method. We study the method in terms of the corresponding chiral random matrix model. It…
We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs, PDEs with boundary feedback and systems of in-domain/boundary coupled…
We give details on how to calculate spectral functions and Green's functions for finite systems using the Chebyshev polynomial expansion method. We apply the method to a finite Anderson impurity system, and furthermore give details on how…
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all feasible solutions have irrational entries, numerical…
Integration is indispensable, not only in mathematics, but also in a wide range of other fields. A deep learning method has recently been developed and shown to be capable of integrating mathematical functions that could not previously be…
The method of analytic continuation is one of the most powerful tools to circumvent the sign problem in lattice QCD. The present study is part of a larger project which, based on the investigation of QCD-like theories which are free of the…
The framework of Light Logics has been extensively studied to control the complexity of higher-order functional programs. We propose an extension of this framework to multithreaded programs with side effects, focusing on the case of…
We introduce a symbolic representation of $r$-fold harmonic sums at negative indices. This representation allows us to recover and extend some recent results by Duchamp et al., such as recurrence relations and generating functions for these…
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show that a deterministic black-box identity testing algorithm for…
In this paper, we consider the problem of invariant set computation for black-box switched linear systems using merely a finite set of observations of system trajectories. In particular, this paper focuses on polyhedral invariant sets. We…
Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…