Control Theoretic Splines : : Optimal Control, Statistics, and Path Planning / / Clyde Martin, Magnus Egerstedt.
Splines, both interpolatory and smoothing, have a long and rich history that has largely been application driven. This book unifies these constructions in a comprehensive and accessible way, drawing from the latest methods and applications to show how they arise naturally in the theory of linear con...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2009] ©2010 |
Year of Publication: | 2009 |
Edition: | Course Book |
Language: | English |
Series: | Princeton Series in Applied Mathematics ;
29 |
Online Access: | |
Physical Description: | 1 online resource (232 p.) :; 31 line illus. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
9781400833870 |
---|---|
ctrlnum |
(DE-B1597)446610 (OCoLC)979779564 |
collection |
bib_alma |
record_format |
marc |
spelling |
Egerstedt, Magnus, author. aut http://id.loc.gov/vocabulary/relators/aut Control Theoretic Splines : Optimal Control, Statistics, and Path Planning / Clyde Martin, Magnus Egerstedt. Course Book Princeton, NJ : Princeton University Press, [2009] ©2010 1 online resource (232 p.) : 31 line illus. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Princeton Series in Applied Mathematics ; 29 Frontmatter -- Contents -- Preface -- Chapter One. Introduction -- Chapter Two. Control Systems and Minimum Norm Problems -- Chapter Three. Eight Fundamental Problems -- Chapter Four. Smoothing Splines and Generalizations -- Chapter Five. Approximations and Limiting Concepts -- Chapter Six. Smoothing Splines with Continuous Data -- Chapter Seven. Monotone Smoothing Splines -- Chapter Eight. Smoothing Splines as Integral Filters -- Chapter Nine. Optimal Transfer between Affine Varieties -- Chapter Ten. Path Planning and Telemetry -- Chapter Eleven. Node Selection -- Bibliography -- Index restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star Splines, both interpolatory and smoothing, have a long and rich history that has largely been application driven. This book unifies these constructions in a comprehensive and accessible way, drawing from the latest methods and applications to show how they arise naturally in the theory of linear control systems. Magnus Egerstedt and Clyde Martin are leading innovators in the use of control theoretic splines to bring together many diverse applications within a common framework. In this book, they begin with a series of problems ranging from path planning to statistics to approximation. Using the tools of optimization over vector spaces, Egerstedt and Martin demonstrate how all of these problems are part of the same general mathematical framework, and how they are all, to a certain degree, a consequence of the optimization problem of finding the shortest distance from a point to an affine subspace in a Hilbert space. They cover periodic splines, monotone splines, and splines with inequality constraints, and explain how any finite number of linear constraints can be added. This book reveals how the many natural connections between control theory, numerical analysis, and statistics can be used to generate powerful mathematical and analytical tools. This book is an excellent resource for students and professionals in control theory, robotics, engineering, computer graphics, econometrics, and any area that requires the construction of curves based on sets of raw data. Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022) Curve fitting. Interpolation. Smoothing (Numerical analysis). Smoothing (Statistics). Spline-Funktion Steuerungstheorie. Steuerungstheorie Spline-Funktion. MATHEMATICS / Applied. bisacsh Accuracy and precision. Affine space. Affine variety. Algorithm. Approximation. Arbitrarily large. B-spline. Banach space. Bernstein polynomial. Bifurcation theory. Big O notation. Birkhoff interpolation. Boundary value problem. Bézier curve. Chaos theory. Computation. Computational problem. Condition number. Constrained optimization. Continuous function (set theory). Continuous function. Control function (econometrics). Control theory. Controllability. Convex optimization. Convolution. Cubic Hermite spline. Data set. Derivative. Differentiable function. Differential equation. Dimension (vector space). Directional derivative. Discrete mathematics. Dynamic programming. Equation. Estimation. Filtering problem (stochastic processes). Gaussian quadrature. Gradient descent. Gramian matrix. Growth curve (statistics). Hermite interpolation. Hermite polynomials. Hilbert projection theorem. Hilbert space. Initial condition. Initial value problem. Integral equation. Iterative method. Karush-Kuhn-Tucker conditions. Kernel method. Lagrange polynomial. Law of large numbers. Least squares. Linear algebra. Linear combination. Linear filter. Linear map. Mathematical optimization. Mathematics. Maxima and minima. Monotonic function. Nonlinear programming. Nonlinear system. Normal distribution. Numerical analysis. Numerical stability. Optimal control. Optimization problem. Ordinary differential equation. Orthogonal polynomials. Parameter. Piecewise. Pointwise. Polynomial interpolation. Polynomial. Probability distribution. Quadratic programming. Random variable. Rate of convergence. Ratio test. Riccati equation. Simpson's rule. Simultaneous equations. Smoothing spline. Smoothing. Smoothness. Special case. Spline (mathematics). Spline interpolation. Statistic. Stochastic calculus. Stochastic. Telemetry. Theorem. Trapezoidal rule. Waypoint. Weight function. Without loss of generality. Martin, Clyde, author. aut http://id.loc.gov/vocabulary/relators/aut Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package 9783110515831 ZDB-23-PAM Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 9783110442502 print 9780691132969 https://doi.org/10.1515/9781400833870 https://www.degruyter.com/isbn/9781400833870 Cover https://www.degruyter.com/document/cover/isbn/9781400833870/original |
language |
English |
format |
eBook |
author |
Egerstedt, Magnus, Egerstedt, Magnus, Martin, Clyde, |
spellingShingle |
Egerstedt, Magnus, Egerstedt, Magnus, Martin, Clyde, Control Theoretic Splines : Optimal Control, Statistics, and Path Planning / Princeton Series in Applied Mathematics ; Frontmatter -- Contents -- Preface -- Chapter One. Introduction -- Chapter Two. Control Systems and Minimum Norm Problems -- Chapter Three. Eight Fundamental Problems -- Chapter Four. Smoothing Splines and Generalizations -- Chapter Five. Approximations and Limiting Concepts -- Chapter Six. Smoothing Splines with Continuous Data -- Chapter Seven. Monotone Smoothing Splines -- Chapter Eight. Smoothing Splines as Integral Filters -- Chapter Nine. Optimal Transfer between Affine Varieties -- Chapter Ten. Path Planning and Telemetry -- Chapter Eleven. Node Selection -- Bibliography -- Index |
author_facet |
Egerstedt, Magnus, Egerstedt, Magnus, Martin, Clyde, Martin, Clyde, Martin, Clyde, |
author_variant |
m e me m e me c m cm |
author_role |
VerfasserIn VerfasserIn VerfasserIn |
author2 |
Martin, Clyde, Martin, Clyde, |
author2_variant |
c m cm |
author2_role |
VerfasserIn VerfasserIn |
author_sort |
Egerstedt, Magnus, |
title |
Control Theoretic Splines : Optimal Control, Statistics, and Path Planning / |
title_sub |
Optimal Control, Statistics, and Path Planning / |
title_full |
Control Theoretic Splines : Optimal Control, Statistics, and Path Planning / Clyde Martin, Magnus Egerstedt. |
title_fullStr |
Control Theoretic Splines : Optimal Control, Statistics, and Path Planning / Clyde Martin, Magnus Egerstedt. |
title_full_unstemmed |
Control Theoretic Splines : Optimal Control, Statistics, and Path Planning / Clyde Martin, Magnus Egerstedt. |
title_auth |
Control Theoretic Splines : Optimal Control, Statistics, and Path Planning / |
title_alt |
Frontmatter -- Contents -- Preface -- Chapter One. Introduction -- Chapter Two. Control Systems and Minimum Norm Problems -- Chapter Three. Eight Fundamental Problems -- Chapter Four. Smoothing Splines and Generalizations -- Chapter Five. Approximations and Limiting Concepts -- Chapter Six. Smoothing Splines with Continuous Data -- Chapter Seven. Monotone Smoothing Splines -- Chapter Eight. Smoothing Splines as Integral Filters -- Chapter Nine. Optimal Transfer between Affine Varieties -- Chapter Ten. Path Planning and Telemetry -- Chapter Eleven. Node Selection -- Bibliography -- Index |
title_new |
Control Theoretic Splines : |
title_sort |
control theoretic splines : optimal control, statistics, and path planning / |
series |
Princeton Series in Applied Mathematics ; |
series2 |
Princeton Series in Applied Mathematics ; |
publisher |
Princeton University Press, |
publishDate |
2009 |
physical |
1 online resource (232 p.) : 31 line illus. Issued also in print. |
edition |
Course Book |
contents |
Frontmatter -- Contents -- Preface -- Chapter One. Introduction -- Chapter Two. Control Systems and Minimum Norm Problems -- Chapter Three. Eight Fundamental Problems -- Chapter Four. Smoothing Splines and Generalizations -- Chapter Five. Approximations and Limiting Concepts -- Chapter Six. Smoothing Splines with Continuous Data -- Chapter Seven. Monotone Smoothing Splines -- Chapter Eight. Smoothing Splines as Integral Filters -- Chapter Nine. Optimal Transfer between Affine Varieties -- Chapter Ten. Path Planning and Telemetry -- Chapter Eleven. Node Selection -- Bibliography -- Index |
isbn |
9781400833870 9783110515831 9783110442502 9780691132969 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA297 |
callnumber-sort |
QA 3297.6 E44 42010EB |
url |
https://doi.org/10.1515/9781400833870 https://www.degruyter.com/isbn/9781400833870 https://www.degruyter.com/document/cover/isbn/9781400833870/original |
illustrated |
Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
511 - General principles of mathematics |
dewey-full |
511/.42 |
dewey-sort |
3511 242 |
dewey-raw |
511/.42 |
dewey-search |
511/.42 |
doi_str_mv |
10.1515/9781400833870 |
oclc_num |
979779564 |
work_keys_str_mv |
AT egerstedtmagnus controltheoreticsplinesoptimalcontrolstatisticsandpathplanning AT martinclyde controltheoreticsplinesoptimalcontrolstatisticsandpathplanning |
status_str |
n |
ids_txt_mv |
(DE-B1597)446610 (OCoLC)979779564 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 |
is_hierarchy_title |
Control Theoretic Splines : Optimal Control, Statistics, and Path Planning / |
container_title |
Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package |
author2_original_writing_str_mv |
noLinkedField noLinkedField |
_version_ |
1770176644992991232 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>08613nam a22019935i 4500</leader><controlfield tag="001">9781400833870</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20220131112047.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">220131t20092010nju fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400833870</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400833870</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)446610</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)979779564</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA297.6</subfield><subfield code="b">.E44 2010eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT003000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511/.42</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Egerstedt, Magnus, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Control Theoretic Splines :</subfield><subfield code="b">Optimal Control, Statistics, and Path Planning /</subfield><subfield code="c">Clyde Martin, Magnus Egerstedt.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Course Book</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2009]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (232 p.) :</subfield><subfield code="b">31 line illus.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Series in Applied Mathematics ;</subfield><subfield code="v">29</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Chapter One. Introduction -- </subfield><subfield code="t">Chapter Two. Control Systems and Minimum Norm Problems -- </subfield><subfield code="t">Chapter Three. Eight Fundamental Problems -- </subfield><subfield code="t">Chapter Four. Smoothing Splines and Generalizations -- </subfield><subfield code="t">Chapter Five. Approximations and Limiting Concepts -- </subfield><subfield code="t">Chapter Six. Smoothing Splines with Continuous Data -- </subfield><subfield code="t">Chapter Seven. Monotone Smoothing Splines -- </subfield><subfield code="t">Chapter Eight. Smoothing Splines as Integral Filters -- </subfield><subfield code="t">Chapter Nine. Optimal Transfer between Affine Varieties -- </subfield><subfield code="t">Chapter Ten. Path Planning and Telemetry -- </subfield><subfield code="t">Chapter Eleven. Node Selection -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Splines, both interpolatory and smoothing, have a long and rich history that has largely been application driven. This book unifies these constructions in a comprehensive and accessible way, drawing from the latest methods and applications to show how they arise naturally in the theory of linear control systems. Magnus Egerstedt and Clyde Martin are leading innovators in the use of control theoretic splines to bring together many diverse applications within a common framework. In this book, they begin with a series of problems ranging from path planning to statistics to approximation. Using the tools of optimization over vector spaces, Egerstedt and Martin demonstrate how all of these problems are part of the same general mathematical framework, and how they are all, to a certain degree, a consequence of the optimization problem of finding the shortest distance from a point to an affine subspace in a Hilbert space. They cover periodic splines, monotone splines, and splines with inequality constraints, and explain how any finite number of linear constraints can be added. This book reveals how the many natural connections between control theory, numerical analysis, and statistics can be used to generate powerful mathematical and analytical tools. This book is an excellent resource for students and professionals in control theory, robotics, engineering, computer graphics, econometrics, and any area that requires the construction of curves based on sets of raw data.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Curve fitting.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Interpolation.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Smoothing (Numerical analysis).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Smoothing (Statistics).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Spline-Funktion</subfield><subfield code="x">Steuerungstheorie.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Steuerungstheorie</subfield><subfield code="x">Spline-Funktion.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Applied.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Accuracy and precision.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Affine space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Affine variety.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Approximation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Arbitrarily large.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">B-spline.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Banach space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bernstein polynomial.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bifurcation theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Big O notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Birkhoff interpolation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Boundary value problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bézier curve.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Chaos theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computational problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Condition number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Constrained optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Continuous function (set theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Continuous function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Control function (econometrics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Control theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Controllability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Convex optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Convolution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cubic Hermite spline.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Data set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Derivative.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Differentiable function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Differential equation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dimension (vector space).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Directional derivative.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Discrete mathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dynamic programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Equation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Estimation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Filtering problem (stochastic processes).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gaussian quadrature.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gradient descent.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gramian matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Growth curve (statistics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hermite interpolation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hermite polynomials.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hilbert projection theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hilbert space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Initial condition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Initial value problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Integral equation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Iterative method.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Karush-Kuhn-Tucker conditions.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kernel method.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lagrange polynomial.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Law of large numbers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Least squares.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear algebra.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear combination.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear filter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear map.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Maxima and minima.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Monotonic function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Nonlinear programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Nonlinear system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Normal distribution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Numerical analysis.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Numerical stability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimal control.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimization problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Ordinary differential equation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Orthogonal polynomials.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parameter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Piecewise.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Pointwise.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Polynomial interpolation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Polynomial.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Probability distribution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Quadratic programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Random variable.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Rate of convergence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Ratio test.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Riccati equation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Simpson's rule.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Simultaneous equations.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Smoothing spline.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Smoothing.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Smoothness.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Special case.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Spline (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Spline interpolation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Statistic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic calculus.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Telemetry.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Trapezoidal rule.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Waypoint.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Weight function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Without loss of generality.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martin, Clyde, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton Series in Applied Mathematics eBook-Package</subfield><subfield code="z">9783110515831</subfield><subfield code="o">ZDB-23-PAM</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="z">9783110442502</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691132969</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400833870</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400833870</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9781400833870/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="c">2000</subfield><subfield code="d">2013</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-PAM</subfield></datafield></record></collection> |