نتایج جستجو برای: squares and newton

تعداد نتایج: 16835918  

2003
A. B. Poore B. J. Slocumb B. J. Suchomel F. H. Obermeyer S. M. Herman S. M. Gadaleta

Batch maximum likelihood (ML) and maximum a posteriori (MAP) estimation with process noise is now more than thirty-five years old, and its use in multiple target tracking has long been considered to be too computationally intensive for real-time applications. While this may still be true for general usage, it is ideally suited for special needs such as bias estimation, track initiation and spaw...

Journal: :Automatica 1995
Berend Roorda

In this paper we present several algorithms related to the global total least squares (GTLS) modelling of multivariable time series observed over a finite time interval. A GTLS model is a linear, time-invariant finite-dimensional system with a behaviour that has minimal Frobenius distance to a given observation. The first algorithm determines this distance. We also give a recursive version of t...

Journal: :J. Symb. Comput. 2008
Erich Kaltofen John P. May Zhengfeng Yang Lihong Zhi

We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficients that contain numerical noise. Our algorithms are based on a generalization of the differential forms introduced by W. Ruppert and S. Gao to many variables, and use singular value decomposition or structured total l...

2009
Jung Ook Hong Patrick J. Wolfe

In this paper we propose a model-based approach to instantaneous pitch estimation in noisy speech, by way of incorporating pitch smoothness assumptions into the well-known harmonic model. In this approach, the latent pitch contour is modeled using a basis of smooth polynomials, and is fit to waveform data by way of a harmonic model whose partials have time-varying amplitudes. The resultant nonl...

Journal: :J. Computational Applied Mathematics 2009
Xinghua Song Martin Aigner Falai Chen Bert Jüttler

We propose a new method to approximate a given set of ordered data points by a spatial circular spline curve. At first an initial circular spline curve is generated by biarc interpolation. Then an evolution process based on a least-squares approximation is applied to the curve. During the evolution process, the circular spline curve converges dynamically to a stable shape. Our method does not n...

2017
Sie Long Kek Jiao Li Wah June Leong Mohd Ismail Abd Aziz

Output measurement for nonlinear optimal control problems is an interesting issue. Because the structure of the real plant is complex, the output channel could give a significant response corresponding to the real plant. In this paper, a least squares scheme, which is based on the Gauss-Newton algorithm, is proposed. The aim is to approximate the output that is measured from the real plant. In ...

Journal: :journal of mathematical modeling 2016
nehzat ebrahimi jalil rashidinia

the spline collocation method  is employed to solve a system of linear and nonlinear fredholm and volterra integro-differential equations. the solutions are collocated by cubic b-spline and the integrand is approximated by the newton-cotes formula. we obtain the unique solution for linear and nonlinear system $(nn+3n)times(nn+3n)$ of integro-differential equations. this approximation reduces th...

Journal: :Lecture Notes in Computer Science 2021

Non-linear least squares solvers are used across a broad range of offline and real-time model fitting problems. Most improvements the basic Gauss-Newton algorithm tackle convergence guarantees or leverage sparsity underlying problem structure for computational speedup. With success deep learning methods leveraging large datasets, stochastic optimization received recently lot attention. Our work...

Journal: :Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics 1975

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید