English
Related papers

Related papers: Parametric factorization of non linear second orde…

200 papers

A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…

Exactly Solvable and Integrable Systems · Physics 2010-12-27 Hassan Sedaghat

Randomized iterative algorithms, such as the randomized Kaczmarz method, have gained considerable popularity due to their efficacy in solving matrix-vector and matrix-matrix regression problems. Our present work leverages the insights…

This work investigates the geometry of a nonconvex reformulation of minimizing a general convex loss function $f(X)$ regularized by the matrix nuclear norm $\|X\|_*$. Nuclear-norm regularized matrix inverse problems are at the heart of many…

Numerical Analysis · Computer Science 2017-04-07 Qiuwei Li , Zhihui Zhu , Gongguo Tang

In this review paper, we explain how to apply Renormalization Group ideas to the analysis of the long-time asymptotics of solutions of partial differential equations. We illustrate the method on several examples of nonlinear parabolic…

chao-dyn · Physics 2009-10-22 J. Bricmont , A. Kupiainen

The estimation of parameter standard errors for semi-variogram models is challenging, given the two-step process required to fit a parametric model to spatially correlated data. Motivated by an application in the social-epidemiology, we…

Methodology · Statistics 2023-07-18 Julia Dyck , Odile Sauzet

A new parallel-in-time iterative method is proposed for solving the homogeneous second-order wave equation. The new method involves a coarse scale propagator, allowing for larger time steps, and a fine scale propagator which fully resolves…

Numerical Analysis · Mathematics 2020-01-29 Hieu Nguyen , Richard Tsai

We demonstrate that almost all non-parametric dimensionality reduction methods can be expressed by a simple procedure: regularized loss minimization plus singular value truncation. By distinguishing the role of the loss and regularizer in…

Machine Learning · Computer Science 2012-07-03 Yaoliang Yu , James Neufeld , Ryan Kiros , Xinhua Zhang , Dale Schuurmans

This paper develops one of the methods for study of nonlinear Partial Differential equations. We generalize Sato equation and represent the algorithm for construction of some classes of nonlinear Partial Differential Equations (PDE)…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 A. I. Zenchuk

This paper presents a novel method that allows to generalise the use of the Adam-Bashforth to Partial Differential Equations with local and non local operator. The Method derives a two step Adam-Bashforth numerical scheme in Laplace space…

Analysis of PDEs · Mathematics 2017-08-07 Rodrigue Gnitchogna Batogna , Abdon Atangana

We present two algorithms for computing hypergeometric solutions of second order linear differential operators with rational function coefficients. Our first algorithm searches for solutions of the form \[ \exp(\int r \,…

Symbolic Computation · Computer Science 2016-06-07 Erdal Imamoglu , Mark van Hoeij

Recently substantial progress has been made on generalized factorization techniques in integral domains, in particular $\tau$-factorization. There has also been advances made in investigating factorization in commutative rings with…

Commutative Algebra · Mathematics 2013-12-31 Christopher Park Mooney

We present a method for updating certain hierarchical factorizations for solving linear integral equations with elliptic kernels. In particular, given a factorization corresponding to some initial geometry or material parameters, we can…

Numerical Analysis · Mathematics 2017-02-15 Victor Minden , Anil Damle , Kenneth L. Ho , Lexing Ying

In this paper the Levy-Leblond procedure for linearizing the Schr\"odinger equation to obtain the Pauli equation for one particle is generalized to obtain an $N$-particle equation with spin. This is achieved by using the more universal…

Quantum Physics · Physics 2007-05-23 Irving S. Reed , Todd A. Brun

The general conditions under which the quadratic, uniform and monotonic convergence in the quasilinearization method of solving nonlinear ordinary differential equations could be proved are formulated and elaborated. The generalization of…

Computational Physics · Physics 2009-11-07 V. B. Mandelzweig , F. Tabakin

Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…

Machine Learning · Computer Science 2025-06-23 Zhen Qin , Michael B. Wakin , Zhihui Zhu

An alternative proof of Lie's approach for linearization of scalar second order ODEs is derived using the relationship between $\lambda$-symmetries and first integrals. This relation further leads to a new $\lambda$-symmetry linearization…

Classical Analysis and ODEs · Mathematics 2015-04-03 Ahmad Y. Al-Dweik , M. T. Mustafa , Raed A. Mara'beh , F. M. Mahomed

The problem of solving partial differential equations (PDEs) can be formulated into a least-squares minimization problem, where neural networks are used to parametrize PDE solutions. A global minimizer corresponds to a neural network that…

Numerical Analysis · Mathematics 2020-12-14 Tao Luo , Haizhao Yang

This paper introduces the hierarchical interpolative factorization for elliptic partial differential equations (HIF-DE) in two (2D) and three dimensions (3D). This factorization takes the form of an approximate generalized LU/LDL…

Numerical Analysis · Mathematics 2015-04-21 Kenneth L. Ho , Lexing Ying

Polynomial factorization over $ZZ$ is of great historical and practical importance. Currently, the standard technique is to factor the polynomial over finite fields first and then to lift to integers. Factorization over finite fields can be…

Symbolic Computation · Computer Science 2024-10-22 Shahriar Iravanian

Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our…

Symbolic Computation · Computer Science 2015-03-19 Asieh Pourhaghani