Results 211 to 220 of about 701,348 (263)
Some of the next articles are maybe not open access.
Nature, 1946
THE text-book treatment of linear curves of best fit purports to give the best estimate of the relation w1 = pv1 between variables of true value w1, v1, from a set of measured values, w, v. It is applicable when only one parameter is subject to errors of measurement.
Austen, A. E. W., Pelzer, H.
openaire +2 more sources
THE text-book treatment of linear curves of best fit purports to give the best estimate of the relation w1 = pv1 between variables of true value w1, v1, from a set of measured values, w, v. It is applicable when only one parameter is subject to errors of measurement.
Austen, A. E. W., Pelzer, H.
openaire +2 more sources
Linear scaling density fitting
The Journal of Chemical Physics, 2006Two modifications of the resolution of the identity (RI)/density fitting (DF) approximations are presented. First, we apply linear scaling and J-engine techniques to speed up traditional DF. Second, we develop an algorithm that produces local, accurate fits with effort that scales linearly with system size.
Alex, Sodt +2 more
openaire +2 more sources
NL-FIT: A microcomputer program for non-linear fitting
Computer Programs in Biomedicine, 1983A program for a microcomputer (HP 85) has been written using BASIC language. Given the analytical form of a model y: R leads to R the program computes the optimal parameters for non-linear least-squares fitting and gives information for its statistical evaluation.
G S, Landriani +2 more
openaire +2 more sources
Polygonal fitting for linearization
Review of Scientific Instruments, 1984A novel approach to the linearization of transducer outputs is presented based on polygonal fitting of the transducer function. A circuit for realizing this approach is included. Use of this circuit with the type K thermocouple results in excellent linearization.
Chong-Soo Han, Steven L. Bernasek
openaire +1 more source
Fitting piecewise linear continuous functions
European Journal of Operational Research, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alejandro Toriello, Juan Pablo Vielma
openaire +2 more sources
Linear programming fitting of implicit polynomials
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1998A new implicit polynomial (IP) fitting method is presented. It provides a different way of viewing the IP fitting problem from those of the nonlinear optimization approaches. It requires less computation, and can be done automatically or interactively. Linear programming is used to do the fitting.
Zhibin Lei, David B. Cooper
openaire +1 more source
IMA Journal of Applied Mathematics, 1979
A technique for fitting a linear expression to data with errors in all or any of the variables is described. The form of the errors is restricted to the product of a row (data set) and a column (variable) error value. This form covers many practical cases and allows the development of an efficient algorithm.
openaire +3 more sources
A technique for fitting a linear expression to data with errors in all or any of the variables is described. The form of the errors is restricted to the product of a row (data set) and a column (variable) error value. This form covers many practical cases and allows the development of an efficient algorithm.
openaire +3 more sources
A linear method for the curve fitting of multiexponentials
Journal of Neuroscience Methods, 1996Two single-pass methods for fitting multiexponentials to experimental data are described. These methods rely on the construction of a matrix whose characteristic polynomial is used to determine the rates of decay. In the first method, which we call the multiple-delay method, the matrix is constructed using time delays of the experimental data.
Knisley, Jeff R., Glenn, L. Lee
openaire +3 more sources
A Linear Programming Approach to Surface Fitting
9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), 2007In this paper, we propose a robust surface reconstruction algorithm from the gradient field by minimizing the absolute error between the input and estimated gradient field from the reconstructed surface. The resulting L1 norm based cost function can then be efficiently solved via linear programming.
Zhouyu Fu +2 more
openaire +1 more source

