相关论文: Parametric Integration by Magic Point Empirical In…
Interpolatory methods offer a powerful framework for generating reduced-order models (ROMs) for non-parametric or parametric systems with time-varying inputs. Choosing the interpolation points adaptively remains an area of active interest.…
Through introducing a new iterative formula for divided differnce using Neville's and Aitken's algorithms,we study new iterative methods for interpolation,numerical differentiation and numerical integration formulas with arbitrary order of…
Spingarn's method of partial inverses has found many applications in nonlinear analysis and in optimization. We show that it can be employed to solve composite monotone inclusions in duality, thus opening a new range of applications for the…
Model merging, typically on Instruct and Thinking models, has shown remarkable performance for efficient reasoning. In this paper, we systematically revisit the simplest merging method that interpolates two weights directly. Particularly,…
The Poisson equation on manifolds plays an fundamental role in many applications. Recently, we proposed a novel numerical method called the Point Integral method (PIM) to solve the Poisson equations on manifolds from point clouds. In this…
One approach to parametric and adaptive model reduction is via the interpolation of orthogonal bases, subspaces or positive definite system matrices. In all these cases, the sampled inputs stem from matrix sets that feature a geometric…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
Variational inference uses optimization, rather than integration, to approximate the marginal likelihood, and thereby the posterior, in a Bayesian model. Thanks to advances in computational scalability made in the last decade, variational…
A discussion of the overlap problem of reweighting approaches to evaluating critical phenomenon in fermionic systems is motivated by highlighting the divergence of the joint probability density function of a general ratio. By identifying…
A purely numerical method, Direct ComputationMethod is applied to evaluate Feynman integrals. This method is based on the combination of an efficient numerical integration and an efficient extrapolation. In addition, high-precision…
The exchange antisymmetry between identical fermions gives rise to the well known fermion sign problem, in the form of large cancellation between positive and negative contribution to the partition function, making any simulation methods…
Combining the outputs of multiple classifiers or experts into a single probabilistic classification is a fundamental task in machine learning with broad applications from classifier fusion to expert opinion pooling. Here we present a…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
We study the convergence of a family of numerical integration methods where the numerical integral is formulated as a finite matrix approximation to a multiplication operator. For bounded functions, the convergence has already been…
We investigate the problem of approximating the matrix function $f(A)$ by $r(A)$, with $f$ a Markov function, $r$ a rational interpolant of $f$, and $A$ a symmetric Toeplitz matrix. In a first step, we obtain a new upper bound for the…
Today, many different probabilistic programming languages exist and even more inference mechanisms for these languages. Still, most logic programming based languages use backward reasoning based on SLD resolution for inference. While these…
Probabilistic point-set registration methods have been gaining more attention for their robustness to noise, outliers and occlusions. However, these methods tend to be much slower than the popular iterative closest point (ICP) algorithms,…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
We study numerical integration over bounded regions in $\mathbb{R}^s, s\ge1$ with respect to some probability measure. We replace random sampling with quasi-Monte Carlo methods, where the underlying point set is derived from deterministic…
The challenge to measure exposures regularly forces financial institutions into a choice between an overwhelming computational burden or oversimplification of risk. To resolve this unsettling dilemma, we systematically investigate replacing…