Related papers: Nystrom Methods in the RKQ Algorithm for Initial-v…
The Nystrom method is a popular technique that uses a small number of landmark points to compute a fixed-rank approximation of large kernel matrices that arise in machine learning problems. In practice, to ensure high quality…
A new Runge-Kutta-Nystr\"om method, with phase-lag of order infinity, for the integration of second-order periodic initial-value problems is developed in this paper. The new method is based on the Dormand and Prince Runge-Kutta-Nystr\"om…
We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These…
When one wishes to numerically solve an initial value problem, it is customary to rewrite it as an equivalent first-order system to which a method, usually from the class of Runge-Kutta methods, is applied. Directly treating higher-order…
A class of explicit pseudo two-step Runge-Kutta-Nystr\"{o}m (GEPTRKN) methods for solving second-order initial value problems $y'' = f(t,y,y')$, $y(t_0) = y_0$, $y'(t_0)=y'_0$ has been studied. This new class of methods can be considered a…
Hybrid classical quantum optimization methods have become an important tool for efficiently solving problems in the current generation of NISQ computers. These methods use an optimization algorithm executed in a classical computer, fed with…
Large-scale kernel ridge regression (KRR) is limited by the need to store a large kernel matrix K_t. To avoid storing the entire matrix K_t, Nystrom methods subsample a subset of columns of the kernel matrix, and efficiently find an…
We present fifth order Runge-Kutta-Nystr\"om methods, where we allow the timestep coefficients to assume complex values. Among the methods with complex timesteps, we focus on the ones with the coefficients that have positive real parts.…
Many kernel methods suffer from high time and space complexities and are thus prohibitive in big-data applications. To tackle the computational challenge, the Nystr\"om method has been extensively used to reduce time and space complexities…
Recent advances in nonlinear dynamical systems theory provide a new insight into numerical properties of discrete algorithms developed to solve nonlinear initial value problems. Basic features like accuracy and stability are well pointed…
We study the effect of global error control in the numerical solution of Hamiltonian systems. In particular, we apply the RKQ algorithm in the numerical solution of a Hamiltonian system. This algorithm is designed to provide stepwise…
Recently, an approach known as relaxation has been developed for preserving the correct evolution of a functional in the numerical solution of initial-value problems, using Runge-Kutta methods. We generalize this approach to multistep…
In the paper explicit functional continuous Runge-Kutta and Runge-Kutta-Nystr\"om methods for retarded functional differential equations are considered. New methods for first order equations as well as for second order equations of the…
In the present paper, a Nystrom-type method for second kind Volterra integral equations is introduced and studied. The method makes use of generalized Bernstein polynomials, defined for continuous functions and based on equally spaced…
The Nystrom method has been popular for generating the low-rank approximation of kernel matrices that arise in many machine learning problems. The approximation quality of the Nystrom method depends crucially on the number of selected…
In this paper, we present a fast and accurate numerical scheme for the solution of fifth-order boundary-value problems. We apply the reproducing kernel Hilbert space method (RKHSM) for solving this problem. The analytic results of the…
The Nystr\"om method is a popular low-rank approximation technique for large matrices that arise in kernel methods and convex optimization. Yet, when the data exhibits heavy-tailed spectral decay, the effective dimension of the problem…
Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers…
The Nystr\"om method is a popular choice for finding a low-rank approximation to a symmetric positive semi-definite matrix. The method can fail when applied to symmetric indefinite matrices, for which the error can be unboundedly large. In…
The Nystr\"om method for the numerical solution of Fredholm integral equations of the second kind is generalized by decoupling the set of solution nodes from the set of quadrature nodes. The accuracy and efficiency of the new method is…