相关论文: Complex moment-based method with nonlinear transfo…
A novel algorithm for real-time modal identification in linear vibrating systems with complex modes is introduced, utilizing a combination of first order eigen-perturbation and second order separation techniques. In practical settings,…
A multigrid method is proposed for solving nonlinear eigenvalue problems by the finite element method. With this new scheme, solving nonlinear eigenvalue problem is decomposed to a series of solutions of linear boundary value problems on…
A new analytic approximate technique for addressing nonlinear problems, namely the optimal perturbation iteration method, is introduced and implemented to singular initial value Lane-Emden type problems to test the effectiveness and…
A number of important results of studying large deformations of hyper-elastic shells are obtained using discrete methods of mathematical physics. In the present paper, using the variational method for solving nonlinear boundary problems of…
In this paper, we present a Clenshaw-Curtis-Filon-type method for the weakly singular oscillatory integral with Fourier and Hankel kernels. By interpolating the non-oscillatory and nonsingular part of the integrand at $(N+1)$…
Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear complementarity problems with many degrees of freedom. To solve these problems in a parallel computing environment, we propose two active-set…
A continuous-time path integral Quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low…
The primary focus of this paper is on designing an inexact first-order algorithm for solving constrained nonlinear optimization problems. By controlling the inexactness of the subproblem solution, we can significantly reduce the…
Using non-linear difference equations, combined with symbolic computations, we make a detailed study of the running times of numerous variants of the celebrated Quicksort algorithms, where we consider the variants of single-pivot and…
We consider inverse problems for non-linear hyperbolic and elliptic equations and give an introduction to the method based on the multiple linearization, or on the construction of artificial sources, to solve these problems. The method is…
Computation of moments of transformed random variables is a problem appearing in many engineering applications. The current methods for moment transformation are mostly based on the classical quadrature rules which cannot account for the…
We propose a projection based multi-moment matching method for model order reduction of quadratic-bilinear systems. The goal is to construct a reduced system that ensures higher-order moment matching for the multivariate transfer functions…
Latent variable models with hidden binary units appear in various applications. Learning such models, in particular in the presence of noise, is a challenging computational problem. In this paper we propose a novel spectral approach to this…
In this paper we propose a new non-linear classifier based on a combination of locally linear classifiers. A well known optimization formulation is given as we cast the problem in a $\ell_1$ Multiple Kernel Learning (MKL) problem using many…
Classical multi-scale methods involving two spatial scales face significant challenges when simulating heterogeneous structures with complicated three-scale spatial configurations. This study proposes an innovative higher-order three-scale…
An algorithm for sequential calculation of non-isotropic matrix elements of the collision integral which are necessary for the solution of the non-linear Boltzmann equation by moment method is proposed. Isotropic matrix elements that we…
Strict linear feasibility or linear separation is usually tackled using efficient approximation/stochastic algorithms (that may even run in sub-linear times in expectation). However, today state of the art for solving…
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
We propose an efficient method for the numerical approximation of a general class of two dimensional semilinear parabolic problems on polygonal meshes. The proposed approach takes advantage of the properties of the serendipity version of…
The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…