相关论文: Multiplicative Algorithm for Orthgonal Groups and …

In this paper we combine two powerful computational techniques, well-tempered metadynamics and time lagged independent component analysis. The aim is to develop a new tool for studying rare events and exploring complex free energy…

A recently proposed method for computer simulations in the isothermal-isobaric (NPT) ensemble, based on Langevin-type equations of motion for the particle coordinates and the ``piston'' degree of freedom, is re-derived by straightforward…

The scheme of divided differences is widely used in many approximation and interpolation problems. Computing the Newton coefficients of the interpolating polynomial is the first step of the Bj\"{o}rck and Pereyra algorithm for solving…

We develop a method for offline parameter estimation of discrete multibody dynamics with regularized and frictional kinematic constraints. This setting leads to unobserved degrees of freedom, which we handle using joint state and parameter…

In this paper we derive a Newton type method to solve the non-linear system formed by combining the Tikhonov normal equations and Morozov's discrepancy principle. We prove that by placing a bound on the step size of the Newton iterations…

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…

In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…

We propose an efficient way of solving optimal control problems for rigid-body systems on the basis of inverse dynamics and the multiple-shooting method. We treat all variables, including the state, acceleration, and control input torques,…

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…

This paper describes a method for solving smooth nonconvex minimization problems subject to bound constraints with good worst-case complexity guarantees and practical performance. The method contains elements of two existing methods: the…

For large-scale eigenvalue problems requiring many mutually orthogonal eigenvectors, traditional numerical methods suffer substantial computational and communication costs with limited parallel scalability, primarily due to explicit…

In this paper we develop a straightforward procedure to construct higher dimensional isochronous Hamiltonian systems. We first show that a class of singular Hamiltonian systems obtained through the $\Omega$-modified procedure is equivalent…

There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…

We show that Newton methods for generalized equations are input-to-state stable with respect to disturbances such as due to inexact computations. We then use this result to obtain convergence and robustness of a multistep Newton-type method…

Gradients have been exploited in proposal distributions to accelerate the convergence of Markov chain Monte Carlo algorithms on discrete distributions. However, these methods require a natural differentiable extension of the target discrete…

This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…

A new algorithm for numerical integration of the rigid-body equations of motion is proposed. The algorithm uses the leapfrog scheme and the quantities involved are angular velocities and orientational variables which can be expressed in…

Novel classes of dynamical systems are introduced, including many-body problems characterized by nonlinear equations of motion of Newtonian type ("acceleration equals forces") which determine the motion of points in the complex plane. These…

We introduce an extension of a variationally optimized perturbation method, by combining it with renormalization group properties in a straightforward (perturbative) form. This leads to a very transparent and efficient procedure, with a…

The solution of a (stochastic) differential equation can be locally approximated by a (stochastic) expansion. If the vector field of the differential equation is a polynomial, the corresponding expansion is a linear combination of iterated…