The Resource Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride
Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride
Resource Information
The item Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Missouri University of Science & Technology Library.This item is available to borrow from 1 library branch.
Resource Information
The item Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Missouri University of Science & Technology Library.
This item is available to borrow from 1 library branch.
- Summary
- "Several linear and nonlinear algorithms for solving the discrete Tchebycheff problem are compared in this study. The Lawson algorithm is compared with two more well-known methods of linear Tchebycheff approximation. A new acceleration scheme for the Lawson algorithm is introduced and its performance is tested with an already existing acceleration technique. The new version is found to be better than the previous one but not as effective as the traditional Exchange method. A nonlinear version of Lawson's algorithm is proposed for the solution of problems having approximating functions which are varisolvent. Some linear theorems of Lawson are extended to the nonlinear case. A modification of Osborne and Watson's nonlinear method is introduced and tested on five problems. This new technique improves the efficiency remarkably, particularly for larger problems"--Abstract, page ii
- Language
- eng
- Extent
- 1 online resource (vii, 92 pages)
- Note
- Vita
- Label
- Tchebycheff approximation on a discrete point set : algorithms old and new
- Title
- Tchebycheff approximation on a discrete point set
- Title remainder
- algorithms old and new
- Statement of responsibility
- by William Edward McBride
- Language
- eng
- Summary
- "Several linear and nonlinear algorithms for solving the discrete Tchebycheff problem are compared in this study. The Lawson algorithm is compared with two more well-known methods of linear Tchebycheff approximation. A new acceleration scheme for the Lawson algorithm is introduced and its performance is tested with an already existing acceleration technique. The new version is found to be better than the previous one but not as effective as the traditional Exchange method. A nonlinear version of Lawson's algorithm is proposed for the solution of problems having approximating functions which are varisolvent. Some linear theorems of Lawson are extended to the nonlinear case. A modification of Osborne and Watson's nonlinear method is introduced and tested on five problems. This new technique improves the efficiency remarkably, particularly for larger problems"--Abstract, page ii
- Cataloging source
- UMR
- http://library.link/vocab/creatorDate
- 1940-
- http://library.link/vocab/creatorName
- McBride, William Edward
- Degree
- Ph. D.
- Dissertation year
- 1973.
- Granting institution
- University of Missouri--Rolla
- Illustrations
- illustrations
- Index
- no index present
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- theses
- http://library.link/vocab/subjectName
-
- Approximation theory
- Chebyshev systems
- Label
- Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride
- Note
- Vita
- Bibliography note
- Includes bibliographical references (pages 79-81)
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier.
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent.
- Control code
- 913831905
- Extent
- 1 online resource (vii, 92 pages)
- Form of item
- online
- Media category
- computer
- Media MARC source
- rdamedia.
- Media type code
-
- c
- Other physical details
- illustrations.
- Specific material designation
- remote
- System control number
- (OCoLC)913831905
- Label
- Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride
- Note
- Vita
- Bibliography note
- Includes bibliographical references (pages 79-81)
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier.
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent.
- Control code
- 913831905
- Extent
- 1 online resource (vii, 92 pages)
- Form of item
- online
- Media category
- computer
- Media MARC source
- rdamedia.
- Media type code
-
- c
- Other physical details
- illustrations.
- Specific material designation
- remote
- System control number
- (OCoLC)913831905
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.mst.edu/portal/Tchebycheff-approximation-on-a-discrete-point-set/bsL4A2pgI8s/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.mst.edu/portal/Tchebycheff-approximation-on-a-discrete-point-set/bsL4A2pgI8s/">Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.mst.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.mst.edu/">Missouri University of Science & Technology Library</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.mst.edu/portal/Tchebycheff-approximation-on-a-discrete-point-set/bsL4A2pgI8s/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.mst.edu/portal/Tchebycheff-approximation-on-a-discrete-point-set/bsL4A2pgI8s/">Tchebycheff approximation on a discrete point set : algorithms old and new, by William Edward McBride</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.mst.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.mst.edu/">Missouri University of Science & Technology Library</a></span></span></span></span></div>
