{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/53044"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/53044","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Some aspects of discrete least squares polynomial approximation","abstract":"The purpose of this project was to investigate the method of discrete least squares polynomial approximation and to provide an extension of the method which would allow for a reasonable data-fit while lowering the number of undetermined coefficients. Also, computer programs were to be provided so that one may use the extended method. This project is an outgrowth of work done by Dr. R. De an Riess, Mathematics Department, V.P.I.S.U. There exist several areas of investigation of the theory and some extensions of the computer programs which appear to merit future effort. Possible investigations of the theory include the interpolation result that was mentioned in the discussion of the extended problem, and error bound results. Possible extensions of the programs include the introduction of decision making capabilities so that the user need only specify the data and a tolerance level to achieve a good approximation, and the implementation of the extended programs on the central system.","abstract_html":"The purpose of this project was to investigate the method of discrete least squares polynomial approximation and to provide an extension of the method which would allow for a reasonable data-fit while lowering the number of undetermined coefficients. Also, computer programs were to be provided so that one may use the extended method. This project is an outgrowth of work done by Dr. R. De an Riess, Mathematics Department, V.P.I.S.U. There exist several areas of investigation of the theory and some extensions of the computer programs which appear to merit future effort. Possible investigations of the theory include the interpolation result that was mentioned in the discussion of the extended problem, and error bound results. Possible extensions of the programs include the introduction of decision making capabilities so that the user need only specify the data and a tolerance level to achieve a good approximation, and the implementation of the extended programs on the central system.","abstract_has_math":false,"creators":["Parks, Melvin Lee"],"institution":"Virginia Polytechnic Institute and State University","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Computer Science and Applications","degree_department":"Computer Science and Applications","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1974,"date_issued":"1974","date_published":"1974","updated_at":"2026-07-22T22:19:32Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/53044","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Computer Science and Applications"]},{"key":"dc:creator","label":"Author","values":["Parks, Melvin Lee"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-06-23T19:08:12Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-06-23T19:08:12Z"]},{"key":"dc:date.issued","label":"Date","values":["1974"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Applications"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/53044"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The purpose of this project was to investigate the method of discrete least squares polynomial approximation and to provide an extension of the method which would allow for a reasonable data-fit while lowering the number of undetermined coefficients. Also, computer programs were to be provided so that one may use the extended method. This project is an outgrowth of work done by Dr. R. De an Riess, Mathematics Department, V.P.I.S.U. There exist several areas of investigation of the theory and some extensions of the computer programs which appear to merit future effort. Possible investigations of the theory include the interpolation result that was mentioned in the discussion of the extended problem, and error bound results. Possible extensions of the programs include the introduction of decision making capabilities so that the user need only specify the data and a tolerance level to achieve a good approximation, and the implementation of the extended programs on the central system."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Some aspects of discrete least squares polynomial approximation"]}]}],"canonical_facts":{"dc:contributor.department":["Computer Science and Applications"],"dc:creator":["Parks, Melvin Lee"],"dc:date.accessioned":["2015-06-23T19:08:12Z"],"dc:date.available":["2015-06-23T19:08:12Z"],"dc:date.issued":["1974"],"dc:description.abstract":["The purpose of this project was to investigate the method of discrete least squares polynomial approximation and to provide an extension of the method which would allow for a reasonable data-fit while lowering the number of undetermined coefficients. Also, computer programs were to be provided so that one may use the extended method. This project is an outgrowth of work done by Dr. R. De an Riess, Mathematics Department, V.P.I.S.U. There exist several areas of investigation of the theory and some extensions of the computer programs which appear to merit future effort. Possible investigations of the theory include the interpolation result that was mentioned in the discussion of the extended problem, and error bound results. Possible extensions of the programs include the introduction of decision making capabilities so that the user need only specify the data and a tolerance level to achieve a good approximation, and the implementation of the extended programs on the central system."],"dc:description.degree":["Master of Science"],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/53044"],"dc:language.iso":["en"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Some aspects of discrete least squares polynomial approximation"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Computer Science and Applications"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:32Z"}