Related papers: Pfaffian Systems of A-Hypergeometric Systems II --…
This paper considers sufficient descent Riemannian conjugate gradient methods with line search algorithms. We propose two kinds of sufficient descent nonlinear conjugate gradient methods and prove these methods satisfy the sufficient…
We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…
The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, yields insight into the hierarchy of complexity classes. In particular, the theory produces algebraic tests for a…
We introduce a Frobenius algebra-valued KP hierarchy and show the existence of Frobenius algebra-valued $\tau$-function for this hierarchy. In addition we construct its Hamiltonian structures by using the Adler-Dickey-Gelfand method. As a…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
Gaussian variational approximation is a popular methodology to approximate posterior distributions in Bayesian inference especially in high dimensional and large data settings. To control the computational cost while being able to capture…
We undertake the study of bivariate Horn systems for generic parameters. We prove that these hypergeometric systems are holonomic, and we provide an explicit formula for their holonomic rank as well as bases of their spaces of complex…
There is growing interest in learning Fourier domain sampling strategies (particularly for magnetic resonance imaging, MRI) using optimization approaches. For non-Cartesian sampling patterns, the system models typically involve non-uniform…
It is shown how classes of Fredholm Pfaffians can be computed in terms of canonical, auxiliary Riemann-Hilbert problems as soon as the main kernel in the Pfaffian is either of additive Hankel composition or of truncated Wiener-Hopf type.…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…
Gradient methods are frequently used in large scale image deblurring problems since they avoid the onerous computation of the Hessian matrix of the objective function. Second order information is typically sought by a clever choice of the…
In this paper, we exploit the gradient flow structure of continuous-time formulations of Bayesian inference in terms of their numerical time-stepping. We focus on two particular examples, namely, the continuous-time ensemble Kalman-Bucy…
A computer code is presented for solving the equations of Hartree-Fock-Bogoliubov (HFB) theory by the gradient method, motivated by the need for efficient and robust codes to calculate the configurations required by extensions of HFB such…
By application of the coinduction method as well as Magri method to the ideal of real Hilbert-Schmidt operators we construct the hierarchies of integrable Hamiltonian systems on the Banach Lie-Poisson spaces which consist of these type of…
The ability to efficiently infer system parameters is essential in any signal-processing task that requires fast operation. Dealing with quantum systems, a serious challenge arises due to substantial growth of the underlying Hilbert space…
The memory-based diffusion systems have wide applications in practice. Hopf bifurcations are observed from such systems. To meet the demand for computing the normal forms of the Hopf bifurcations of such systems, we develop an effective new…
In this paper, we present a data-driven approach to identify second-order systems, having internal Rayleigh damping. This means that the damping matrix is given as a linear combination of the mass and stiffness matrices. These systems…
The Grassmannian of affine subspaces is a natural generalization of both the Euclidean space, points being zero-dimensional affine subspaces, and the usual Grassmannian, linear subspaces being special cases of affine subspaces. We show…
Holographic algorithms, alternatively known as Pfaffian circuits, have received a great deal of attention for giving polynomial-time algorithms of $\#\mathsf{P}$-hard problems. Much work has been done to determine the extent of what this…
We propose a surface hopping Gaussian beam method to numerically solve a class of high frequency linear transport systems in high spatial dimensions, based on asymptotic analysis. The stochastic surface hopping is combined with Gaussian…