Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Approximation theory )`

.
Showing records 1 – 30 of
463 total matches.

◁ [1] [2] [3] [4] [5] … [16] ▶

Search Limiters

Dates

- 2016 – 2020 (87)
- 2011 – 2015 (132)
- 2006 – 2010 (89)
- 2001 – 2005 (40)
- 1996 – 2000 (35)
- 1991 – 1995 (24)
- 1986 – 1990 (21)
- 1981 – 1985 (16)
- 1976 – 1980 (14)
- 1971 – 1975 (26)

Universities

- University of Florida (62)
- ETH Zürich (42)
- Georgia Tech (19)
- Texas Tech University (16)
- Michigan State University (13)
- Hong Kong University of Science and Technology (11)
- University of Hong Kong (11)
- Virginia Tech (10)

Department

- Mathematics (36)
- Physics (18)

Degrees

- PhD (142)
- Docteur es (29)
- MS (17)

▼ Search Limiters

University of Manitoba

1.
Muliarchyk, Kyrylo.
Polynomial *approximation* in weighted spaces.

Degree: Mathematics, 2019, University of Manitoba

URL: http://hdl.handle.net/1993/34201

► One of the most important problems in *Approximation* *Theory* is to connect the rate with which a function can be approximated and the smoothness of…
(more)

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Muliarchyk, K. (2019). Polynomial approximation in weighted spaces. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/34201

Chicago Manual of Style (16^{th} Edition):

Muliarchyk, Kyrylo. “Polynomial approximation in weighted spaces.” 2019. Masters Thesis, University of Manitoba. Accessed August 13, 2020. http://hdl.handle.net/1993/34201.

MLA Handbook (7^{th} Edition):

Muliarchyk, Kyrylo. “Polynomial approximation in weighted spaces.” 2019. Web. 13 Aug 2020.

Vancouver:

Muliarchyk K. Polynomial approximation in weighted spaces. [Internet] [Masters thesis]. University of Manitoba; 2019. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/1993/34201.

Council of Science Editors:

Muliarchyk K. Polynomial approximation in weighted spaces. [Masters Thesis]. University of Manitoba; 2019. Available from: http://hdl.handle.net/1993/34201

Montana State University

2.
Schmidt, Darrell Patrick.
Linear and nonlinear product * approximation*.

Degree: College of Letters & Science, 1976, Montana State University

URL: https://scholarworks.montana.edu/xmlui/handle/1/4607

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Schmidt, D. P. (1976). Linear and nonlinear product approximation. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/4607

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Schmidt, Darrell Patrick. “Linear and nonlinear product approximation.” 1976. Thesis, Montana State University. Accessed August 13, 2020. https://scholarworks.montana.edu/xmlui/handle/1/4607.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schmidt, Darrell Patrick. “Linear and nonlinear product approximation.” 1976. Web. 13 Aug 2020.

Vancouver:

Schmidt DP. Linear and nonlinear product approximation. [Internet] [Thesis]. Montana State University; 1976. [cited 2020 Aug 13]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/4607.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schmidt DP. Linear and nonlinear product approximation. [Thesis]. Montana State University; 1976. Available from: https://scholarworks.montana.edu/xmlui/handle/1/4607

Not specified: Masters Thesis or Doctoral Dissertation

Montana Tech

3.
Haight, Gordon M.
The Weierstrass *approximation* theorem.

Degree: MA, 1967, Montana Tech

URL: https://scholarworks.umt.edu/etd/6122

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Haight, G. M. (1967). The Weierstrass approximation theorem. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/6122

Chicago Manual of Style (16^{th} Edition):

Haight, Gordon M. “The Weierstrass approximation theorem.” 1967. Masters Thesis, Montana Tech. Accessed August 13, 2020. https://scholarworks.umt.edu/etd/6122.

MLA Handbook (7^{th} Edition):

Haight, Gordon M. “The Weierstrass approximation theorem.” 1967. Web. 13 Aug 2020.

Vancouver:

Haight GM. The Weierstrass approximation theorem. [Internet] [Masters thesis]. Montana Tech; 1967. [cited 2020 Aug 13]. Available from: https://scholarworks.umt.edu/etd/6122.

Council of Science Editors:

Haight GM. The Weierstrass approximation theorem. [Masters Thesis]. Montana Tech; 1967. Available from: https://scholarworks.umt.edu/etd/6122

Oregon State University

4. Ojha, Murari Prasad. Smooth approximations and quermassintegrals.

Degree: PhD, Mathematics, 1982, Oregon State University

URL: http://hdl.handle.net/1957/17499

See pdf.
*Advisors/Committee Members: Goheen, Harry E. (advisor).*

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ojha, M. P. (1982). Smooth approximations and quermassintegrals. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17499

Chicago Manual of Style (16^{th} Edition):

Ojha, Murari Prasad. “Smooth approximations and quermassintegrals.” 1982. Doctoral Dissertation, Oregon State University. Accessed August 13, 2020. http://hdl.handle.net/1957/17499.

MLA Handbook (7^{th} Edition):

Ojha, Murari Prasad. “Smooth approximations and quermassintegrals.” 1982. Web. 13 Aug 2020.

Vancouver:

Ojha MP. Smooth approximations and quermassintegrals. [Internet] [Doctoral dissertation]. Oregon State University; 1982. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/1957/17499.

Council of Science Editors:

Ojha MP. Smooth approximations and quermassintegrals. [Doctoral Dissertation]. Oregon State University; 1982. Available from: http://hdl.handle.net/1957/17499

Oregon State University

5.
Lo, Wen-so.
Spectral *approximation* *theory* for bounded linear operators.

Degree: PhD, Mathematics, 1972, Oregon State University

URL: http://hdl.handle.net/1957/17549

► In this thesis we examine the *approximation* *theory* of the eigenvalue problem of bounded linear operators defined on a Banach space, and its applications to…
(more)

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lo, W. (1972). Spectral approximation theory for bounded linear operators. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17549

Chicago Manual of Style (16^{th} Edition):

Lo, Wen-so. “Spectral approximation theory for bounded linear operators.” 1972. Doctoral Dissertation, Oregon State University. Accessed August 13, 2020. http://hdl.handle.net/1957/17549.

MLA Handbook (7^{th} Edition):

Lo, Wen-so. “Spectral approximation theory for bounded linear operators.” 1972. Web. 13 Aug 2020.

Vancouver:

Lo W. Spectral approximation theory for bounded linear operators. [Internet] [Doctoral dissertation]. Oregon State University; 1972. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/1957/17549.

Council of Science Editors:

Lo W. Spectral approximation theory for bounded linear operators. [Doctoral Dissertation]. Oregon State University; 1972. Available from: http://hdl.handle.net/1957/17549

Oregon State University

6. Shoji, Fumihiro Frank. Simplification of large linear systems using two-step iterative method.

Degree: E.E., 1979, Oregon State University

URL: http://hdl.handle.net/1957/42605

► The order of the practical system (e.g. nuclear power plants, electrical power network and chemical plant) is quite large. However, there are many limitations in…
(more)

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Shoji, F. F. (1979). Simplification of large linear systems using two-step iterative method. (Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/42605

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Shoji, Fumihiro Frank. “Simplification of large linear systems using two-step iterative method.” 1979. Thesis, Oregon State University. Accessed August 13, 2020. http://hdl.handle.net/1957/42605.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Shoji, Fumihiro Frank. “Simplification of large linear systems using two-step iterative method.” 1979. Web. 13 Aug 2020.

Vancouver:

Shoji FF. Simplification of large linear systems using two-step iterative method. [Internet] [Thesis]. Oregon State University; 1979. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/1957/42605.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shoji FF. Simplification of large linear systems using two-step iterative method. [Thesis]. Oregon State University; 1979. Available from: http://hdl.handle.net/1957/42605

Not specified: Masters Thesis or Doctoral Dissertation

7.
Allbee, Matthew.
An *approximation* algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.

Degree: 2018, University of Wisconsin – Whitewater

URL: http://digital.library.wisc.edu/1793/78968

►

This file was last viewed in Microsoft Edge.

Substantial work has gone into ﬁnding techniques for solving real-world sized Nash games. Stackelberg Equilibria is another… (more)

Subjects/Keywords: Game theory; Approximation algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Allbee, M. (2018). An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. (Thesis). University of Wisconsin – Whitewater. Retrieved from http://digital.library.wisc.edu/1793/78968

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Allbee, Matthew. “An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.” 2018. Thesis, University of Wisconsin – Whitewater. Accessed August 13, 2020. http://digital.library.wisc.edu/1793/78968.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Allbee, Matthew. “An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.” 2018. Web. 13 Aug 2020.

Vancouver:

Allbee M. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. [Internet] [Thesis]. University of Wisconsin – Whitewater; 2018. [cited 2020 Aug 13]. Available from: http://digital.library.wisc.edu/1793/78968.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Allbee M. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. [Thesis]. University of Wisconsin – Whitewater; 2018. Available from: http://digital.library.wisc.edu/1793/78968

Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

8.
Tornga, J. Edward, 1942-.
* Approximation* from varisolvent and unisolvent families whose members have restricted ranges.

Degree: PhD, Department of Mathematics, 1971, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:35189

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tornga, J. Edward, 1. (1971). Approximation from varisolvent and unisolvent families whose members have restricted ranges. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:35189

Chicago Manual of Style (16^{th} Edition):

Tornga, J. Edward, 1942-. “Approximation from varisolvent and unisolvent families whose members have restricted ranges.” 1971. Doctoral Dissertation, Michigan State University. Accessed August 13, 2020. http://etd.lib.msu.edu/islandora/object/etd:35189.

MLA Handbook (7^{th} Edition):

Tornga, J. Edward, 1942-. “Approximation from varisolvent and unisolvent families whose members have restricted ranges.” 1971. Web. 13 Aug 2020.

Vancouver:

Tornga, J. Edward 1. Approximation from varisolvent and unisolvent families whose members have restricted ranges. [Internet] [Doctoral dissertation]. Michigan State University; 1971. [cited 2020 Aug 13]. Available from: http://etd.lib.msu.edu/islandora/object/etd:35189.

Council of Science Editors:

Tornga, J. Edward 1. Approximation from varisolvent and unisolvent families whose members have restricted ranges. [Doctoral Dissertation]. Michigan State University; 1971. Available from: http://etd.lib.msu.edu/islandora/object/etd:35189

University of Adelaide

9.
Howlett, Philip George.
* Approximation* to summable functions.

Degree: 1970, University of Adelaide

URL: http://hdl.handle.net/2440/20879

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Howlett, P. G. (1970). Approximation to summable functions. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/20879

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Howlett, Philip George. “Approximation to summable functions.” 1970. Thesis, University of Adelaide. Accessed August 13, 2020. http://hdl.handle.net/2440/20879.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Howlett, Philip George. “Approximation to summable functions.” 1970. Web. 13 Aug 2020.

Vancouver:

Howlett PG. Approximation to summable functions. [Internet] [Thesis]. University of Adelaide; 1970. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/2440/20879.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Howlett PG. Approximation to summable functions. [Thesis]. University of Adelaide; 1970. Available from: http://hdl.handle.net/2440/20879

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

10.
Li, Jixin.
Saddle point *approximation*:.

Degree: PhD, Statistics and Biostatistics, 2009, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043

►

We extend known saddlepoint tail probability approximations to multivariate cases, including multivariate conditional cases. Our first *approximation* applies to both continuous and lattice variables, and…
(more)

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Li, J. (2009). Saddle point approximation:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043

Chicago Manual of Style (16^{th} Edition):

Li, Jixin. “Saddle point approximation:.” 2009. Doctoral Dissertation, Rutgers University. Accessed August 13, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043.

MLA Handbook (7^{th} Edition):

Li, Jixin. “Saddle point approximation:.” 2009. Web. 13 Aug 2020.

Vancouver:

Li J. Saddle point approximation:. [Internet] [Doctoral dissertation]. Rutgers University; 2009. [cited 2020 Aug 13]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043.

Council of Science Editors:

Li J. Saddle point approximation:. [Doctoral Dissertation]. Rutgers University; 2009. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043

Rutgers University

11. Xu, Lu, 1979-. Small sample inference for collections of Bernoulli trials:.

Degree: PhD, Statistics and Biostatistics, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166

► This dissertation discusses two applied problems solved by saddlepoint *approximation* methods. The first part of this thesis concerns continuity corrected saddlepoint approximations for testing and…
(more)

Subjects/Keywords: Approximation theory; Bernoulli numbers

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Xu, Lu, 1. (2010). Small sample inference for collections of Bernoulli trials:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166

Chicago Manual of Style (16^{th} Edition):

Xu, Lu, 1979-. “Small sample inference for collections of Bernoulli trials:.” 2010. Doctoral Dissertation, Rutgers University. Accessed August 13, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166.

MLA Handbook (7^{th} Edition):

Xu, Lu, 1979-. “Small sample inference for collections of Bernoulli trials:.” 2010. Web. 13 Aug 2020.

Vancouver:

Xu, Lu 1. Small sample inference for collections of Bernoulli trials:. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Aug 13]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166.

Council of Science Editors:

Xu, Lu 1. Small sample inference for collections of Bernoulli trials:. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166

Rutgers University

12.
Naumovitz, Timothy Ryan.
Very efficient *approximation* algorithms to edit distance problems.

Degree: PhD, Mathematics, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

►

This thesis deals with the question of approximating distance to monotonicity in the streaming setting as well as the task of approximating the ulam distance… (more)

Subjects/Keywords: Computer algorithms; Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Naumovitz, T. R. (2016). Very efficient approximation algorithms to edit distance problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

Chicago Manual of Style (16^{th} Edition):

Naumovitz, Timothy Ryan. “Very efficient approximation algorithms to edit distance problems.” 2016. Doctoral Dissertation, Rutgers University. Accessed August 13, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

MLA Handbook (7^{th} Edition):

Naumovitz, Timothy Ryan. “Very efficient approximation algorithms to edit distance problems.” 2016. Web. 13 Aug 2020.

Vancouver:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Aug 13]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

Council of Science Editors:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

Michigan State University

13.
Platte, Donald Marvin, 1942-.
* Approximation* with Hermite-Birkhoff interpolatory constraints and related H-set

Degree: PhD, Department of Mathematics, 1972, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:37217

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Platte, Donald Marvin, 1. (1972). Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:37217

Chicago Manual of Style (16^{th} Edition):

Platte, Donald Marvin, 1942-. “Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory.” 1972. Doctoral Dissertation, Michigan State University. Accessed August 13, 2020. http://etd.lib.msu.edu/islandora/object/etd:37217.

MLA Handbook (7^{th} Edition):

Platte, Donald Marvin, 1942-. “Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory.” 1972. Web. 13 Aug 2020.

Vancouver:

Platte, Donald Marvin 1. Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory. [Internet] [Doctoral dissertation]. Michigan State University; 1972. [cited 2020 Aug 13]. Available from: http://etd.lib.msu.edu/islandora/object/etd:37217.

Council of Science Editors:

Platte, Donald Marvin 1. Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory. [Doctoral Dissertation]. Michigan State University; 1972. Available from: http://etd.lib.msu.edu/islandora/object/etd:37217

Michigan State University

14.
Brink, Daryl Myron, 1944-.
Tchebycheff *approximation* by reciprocals of polynomials on [0, [infinity]).

Degree: PhD, Department of Mathematics, 1972, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:34615

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Brink, Daryl Myron, 1. (1972). Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]). (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:34615

Chicago Manual of Style (16^{th} Edition):

Brink, Daryl Myron, 1944-. “Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]).” 1972. Doctoral Dissertation, Michigan State University. Accessed August 13, 2020. http://etd.lib.msu.edu/islandora/object/etd:34615.

MLA Handbook (7^{th} Edition):

Brink, Daryl Myron, 1944-. “Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]).” 1972. Web. 13 Aug 2020.

Vancouver:

Brink, Daryl Myron 1. Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]). [Internet] [Doctoral dissertation]. Michigan State University; 1972. [cited 2020 Aug 13]. Available from: http://etd.lib.msu.edu/islandora/object/etd:34615.

Council of Science Editors:

Brink, Daryl Myron 1. Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]). [Doctoral Dissertation]. Michigan State University; 1972. Available from: http://etd.lib.msu.edu/islandora/object/etd:34615

University of Hong Kong

15.
Ng, Shu-ming.
Some theorems in
*approximation* * theory*.

Degree: 1979, University of Hong Kong

URL: http://hdl.handle.net/10722/32805

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ng, S. (1979). Some theorems in approximation theory. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/32805

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ng, Shu-ming. “Some theorems in approximation theory.” 1979. Thesis, University of Hong Kong. Accessed August 13, 2020. http://hdl.handle.net/10722/32805.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ng, Shu-ming. “Some theorems in approximation theory.” 1979. Web. 13 Aug 2020.

Vancouver:

Ng S. Some theorems in approximation theory. [Internet] [Thesis]. University of Hong Kong; 1979. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/10722/32805.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ng S. Some theorems in approximation theory. [Thesis]. University of Hong Kong; 1979. Available from: http://hdl.handle.net/10722/32805

Not specified: Masters Thesis or Doctoral Dissertation

University of Arizona

16.
Smith, J. B., 1938-.
SOME PROBLEMS IN THE *THEORY* OF * APPROXIMATION*
.

Degree: 1968, University of Arizona

URL: http://hdl.handle.net/10150/284953

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Smith, J. B., 1. (1968). SOME PROBLEMS IN THE THEORY OF APPROXIMATION . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/284953

Chicago Manual of Style (16^{th} Edition):

Smith, J. B., 1938-. “SOME PROBLEMS IN THE THEORY OF APPROXIMATION .” 1968. Doctoral Dissertation, University of Arizona. Accessed August 13, 2020. http://hdl.handle.net/10150/284953.

MLA Handbook (7^{th} Edition):

Smith, J. B., 1938-. “SOME PROBLEMS IN THE THEORY OF APPROXIMATION .” 1968. Web. 13 Aug 2020.

Vancouver:

Smith, J. B. 1. SOME PROBLEMS IN THE THEORY OF APPROXIMATION . [Internet] [Doctoral dissertation]. University of Arizona; 1968. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/10150/284953.

Council of Science Editors:

Smith, J. B. 1. SOME PROBLEMS IN THE THEORY OF APPROXIMATION . [Doctoral Dissertation]. University of Arizona; 1968. Available from: http://hdl.handle.net/10150/284953

Hong Kong University of Science and Technology

17. Zhang, Kan. Berry-Esseen bounds for studentized statistics by Stein's method.

Degree: 2012, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html

► The Stein's method, originally introduced by Stein (1972), gives us a novel wayto investigate normal *approximation*. This method has since been developed in different areas…
(more)

Subjects/Keywords: Mathematical statistics ; Approximation theory ; Distribution (Probability theory)

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Zhang, K. (2012). Berry-Esseen bounds for studentized statistics by Stein's method. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Zhang, Kan. “Berry-Esseen bounds for studentized statistics by Stein's method.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed August 13, 2020. http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Kan. “Berry-Esseen bounds for studentized statistics by Stein's method.” 2012. Web. 13 Aug 2020.

Vancouver:

Zhang K. Berry-Esseen bounds for studentized statistics by Stein's method. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2020 Aug 13]. Available from: http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang K. Berry-Esseen bounds for studentized statistics by Stein's method. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

18. Zhang, Mengchen. Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method.

Degree: 2017, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html

► In this thesis, first we develop a result of Stein's method for non-normal *approximation* via exchangeable pair approach. By this result, we derive Berry-Esseen bounds…
(more)

Subjects/Keywords: Mathematical statistics ; Approximation theory ; Distribution (Probability theory)

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Zhang, M. (2017). Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Zhang, Mengchen. “Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method.” 2017. Thesis, Hong Kong University of Science and Technology. Accessed August 13, 2020. http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Mengchen. “Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method.” 2017. Web. 13 Aug 2020.

Vancouver:

Zhang M. Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2017. [cited 2020 Aug 13]. Available from: http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang M. Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method. [Thesis]. Hong Kong University of Science and Technology; 2017. Available from: http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

19.
Khani, Mohammad Reza.
Improved *approximation* algorithms for Min-Max Tree Cover,
Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree,
and (k, 2)-Subgraph.

Degree: MS, Department of Computing Science, 2011, University of Alberta

URL: https://era.library.ualberta.ca/files/cbr86b369q

► In this thesis we provide improved *approximation* algorithms for the Min-Max k-Tree Cover, Bounded Tree Cover and Shallow-Light k-Steiner Tree, (k, 2)-subgraph problems. In Chapter…
(more)

Subjects/Keywords: Theory of Computation; Approximation Algorithms; CombinatorialOptimization; Hardness of Approximation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Khani, M. R. (2011). Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cbr86b369q

Chicago Manual of Style (16^{th} Edition):

Khani, Mohammad Reza. “Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.” 2011. Masters Thesis, University of Alberta. Accessed August 13, 2020. https://era.library.ualberta.ca/files/cbr86b369q.

MLA Handbook (7^{th} Edition):

Khani, Mohammad Reza. “Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.” 2011. Web. 13 Aug 2020.

Vancouver:

Khani MR. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2020 Aug 13]. Available from: https://era.library.ualberta.ca/files/cbr86b369q.

Council of Science Editors:

Khani MR. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/cbr86b369q

20. Briest, Patrick. Computational aspects of combinatorial pricing problems.

Degree: 2007, Technische Universität Dortmund

URL: http://hdl.handle.net/2003/24877

► Combinatorial pricing encompasses a wide range of natural optimization problems that arise in the computation of revenue maximizing pricing schemes for a given set of…
(more)

Subjects/Keywords: algorithmic game theory; approximation algorithms; hardness of approximation; pricing; 004

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Briest, P. (2007). Computational aspects of combinatorial pricing problems. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/24877

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Thesis, Technische Universität Dortmund. Accessed August 13, 2020. http://hdl.handle.net/2003/24877.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 13 Aug 2020.

Vancouver:

Briest P. Computational aspects of combinatorial pricing problems. [Internet] [Thesis]. Technische Universität Dortmund; 2007. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/2003/24877.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Briest P. Computational aspects of combinatorial pricing problems. [Thesis]. Technische Universität Dortmund; 2007. Available from: http://hdl.handle.net/2003/24877

Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

21.
Ruppert, David, 1948-.
A new dynamic stochastic *approximation* procedure.

Degree: PhD, 1977, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:43624

Subjects/Keywords: Stochastic approximation; Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ruppert, David, 1. (1977). A new dynamic stochastic approximation procedure. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:43624

Chicago Manual of Style (16^{th} Edition):

Ruppert, David, 1948-. “A new dynamic stochastic approximation procedure.” 1977. Doctoral Dissertation, Michigan State University. Accessed August 13, 2020. http://etd.lib.msu.edu/islandora/object/etd:43624.

MLA Handbook (7^{th} Edition):

Ruppert, David, 1948-. “A new dynamic stochastic approximation procedure.” 1977. Web. 13 Aug 2020.

Vancouver:

Ruppert, David 1. A new dynamic stochastic approximation procedure. [Internet] [Doctoral dissertation]. Michigan State University; 1977. [cited 2020 Aug 13]. Available from: http://etd.lib.msu.edu/islandora/object/etd:43624.

Council of Science Editors:

Ruppert, David 1. A new dynamic stochastic approximation procedure. [Doctoral Dissertation]. Michigan State University; 1977. Available from: http://etd.lib.msu.edu/islandora/object/etd:43624

22.
NC DOCKS at The University of North Carolina at Greensboro; Payne, Catherine Ann.
* Approximation* of neutral delay-differential equations.

Degree: 2017, NC Docks

URL: http://libres.uncg.edu/ir/uncg/f/Payne_uncg_0154D_12302.pdf

► [Mathematical notation cannot be correctly represented here; please see PDF below for full equations.] We study questions related to stability and *approximation* of the system…
(more)

Subjects/Keywords: Delay differential equations; Semigroups; Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

NC DOCKS at The University of North Carolina at Greensboro; Payne, C. A. (2017). Approximation of neutral delay-differential equations. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/Payne_uncg_0154D_12302.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

NC DOCKS at The University of North Carolina at Greensboro; Payne, Catherine Ann. “Approximation of neutral delay-differential equations.” 2017. Thesis, NC Docks. Accessed August 13, 2020. http://libres.uncg.edu/ir/uncg/f/Payne_uncg_0154D_12302.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

NC DOCKS at The University of North Carolina at Greensboro; Payne, Catherine Ann. “Approximation of neutral delay-differential equations.” 2017. Web. 13 Aug 2020.

Vancouver:

NC DOCKS at The University of North Carolina at Greensboro; Payne CA. Approximation of neutral delay-differential equations. [Internet] [Thesis]. NC Docks; 2017. [cited 2020 Aug 13]. Available from: http://libres.uncg.edu/ir/uncg/f/Payne_uncg_0154D_12302.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

NC DOCKS at The University of North Carolina at Greensboro; Payne CA. Approximation of neutral delay-differential equations. [Thesis]. NC Docks; 2017. Available from: http://libres.uncg.edu/ir/uncg/f/Payne_uncg_0154D_12302.pdf

Not specified: Masters Thesis or Doctoral Dissertation

23.
Bobade, Parag Suhas.
Modeling, *Approximation*, and Control for a Class of Nonlinear Systems.

Degree: PhD, Engineering Science and Mechanics, 2017, Virginia Tech

URL: http://hdl.handle.net/10919/80978

► This work investigates modeling, *approximation*, estimation, and control for classes of nonlinear systems whose state evolves in space ℝ^{n} times H, where ℝ^{n} is a…
(more)

Subjects/Keywords: Adaptive Estimation; Approximation Theory; Functional Differential Equations

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bobade, P. S. (2017). Modeling, Approximation, and Control for a Class of Nonlinear Systems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/80978

Chicago Manual of Style (16^{th} Edition):

Bobade, Parag Suhas. “Modeling, Approximation, and Control for a Class of Nonlinear Systems.” 2017. Doctoral Dissertation, Virginia Tech. Accessed August 13, 2020. http://hdl.handle.net/10919/80978.

MLA Handbook (7^{th} Edition):

Bobade, Parag Suhas. “Modeling, Approximation, and Control for a Class of Nonlinear Systems.” 2017. Web. 13 Aug 2020.

Vancouver:

Bobade PS. Modeling, Approximation, and Control for a Class of Nonlinear Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2017. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/10919/80978.

Council of Science Editors:

Bobade PS. Modeling, Approximation, and Control for a Class of Nonlinear Systems. [Doctoral Dissertation]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/80978

University of Oklahoma

24.
Howland, John Elton.
Contributions to the *theory* of Tchebycheff * approximation*.

Degree: PhD, 1971, University of Oklahoma

URL: http://hdl.handle.net/11244/2928

Subjects/Keywords: Mathematics.; Approximation theory.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Howland, J. E. (1971). Contributions to the theory of Tchebycheff approximation. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/2928

Chicago Manual of Style (16^{th} Edition):

Howland, John Elton. “Contributions to the theory of Tchebycheff approximation.” 1971. Doctoral Dissertation, University of Oklahoma. Accessed August 13, 2020. http://hdl.handle.net/11244/2928.

MLA Handbook (7^{th} Edition):

Howland, John Elton. “Contributions to the theory of Tchebycheff approximation.” 1971. Web. 13 Aug 2020.

Vancouver:

Howland JE. Contributions to the theory of Tchebycheff approximation. [Internet] [Doctoral dissertation]. University of Oklahoma; 1971. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/11244/2928.

Council of Science Editors:

Howland JE. Contributions to the theory of Tchebycheff approximation. [Doctoral Dissertation]. University of Oklahoma; 1971. Available from: http://hdl.handle.net/11244/2928

University of Houston

25. Liao, Hung Zen 1983-. Some Results on the Degeneracy of Entire Curves and Integral Points in the Complements of Divisors.

Degree: PhD, Mathematics, 2016, University of Houston

URL: http://hdl.handle.net/10657/5410

► In this dissertation, we first discuss some of the important results in Nevanlinna *Theory* and Diophantine *Approximation* *Theory*. Next, a result by the author and…
(more)

Subjects/Keywords: Navenlinna Theory; Diophantine approximation; Holomorphic curves

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Liao, H. Z. 1. (2016). Some Results on the Degeneracy of Entire Curves and Integral Points in the Complements of Divisors. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/5410

Chicago Manual of Style (16^{th} Edition):

Liao, Hung Zen 1983-. “Some Results on the Degeneracy of Entire Curves and Integral Points in the Complements of Divisors.” 2016. Doctoral Dissertation, University of Houston. Accessed August 13, 2020. http://hdl.handle.net/10657/5410.

MLA Handbook (7^{th} Edition):

Liao, Hung Zen 1983-. “Some Results on the Degeneracy of Entire Curves and Integral Points in the Complements of Divisors.” 2016. Web. 13 Aug 2020.

Vancouver:

Liao HZ1. Some Results on the Degeneracy of Entire Curves and Integral Points in the Complements of Divisors. [Internet] [Doctoral dissertation]. University of Houston; 2016. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/10657/5410.

Council of Science Editors:

Liao HZ1. Some Results on the Degeneracy of Entire Curves and Integral Points in the Complements of Divisors. [Doctoral Dissertation]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/5410

Hong Kong University of Science and Technology

26. Tsang, Ho Tak. Vehicle routing problem with heterogeneous vehicles.

Degree: 2011, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html

► The thesis presents a novel two-phase approach for heterogeneous fleet in Vehicle Routing Problem (VRP). In view of considerable difficulty to solve the class of…
(more)

Subjects/Keywords: Vehicle routing problem – Mathematical models ; Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tsang, H. T. (2011). Vehicle routing problem with heterogeneous vehicles. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tsang, Ho Tak. “Vehicle routing problem with heterogeneous vehicles.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed August 13, 2020. http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tsang, Ho Tak. “Vehicle routing problem with heterogeneous vehicles.” 2011. Web. 13 Aug 2020.

Vancouver:

Tsang HT. Vehicle routing problem with heterogeneous vehicles. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2020 Aug 13]. Available from: http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsang HT. Vehicle routing problem with heterogeneous vehicles. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

27. Gibson, John Bryon, 1943-. Optimal starting approximations for iterative schemes from classes of rational functions.

Degree: PhD, Department of Mathematics, 1971, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:40326

Subjects/Keywords: Approximation theory; Functions

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gibson, John Bryon, 1. (1971). Optimal starting approximations for iterative schemes from classes of rational functions. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:40326

Chicago Manual of Style (16^{th} Edition):

Gibson, John Bryon, 1943-. “Optimal starting approximations for iterative schemes from classes of rational functions.” 1971. Doctoral Dissertation, Michigan State University. Accessed August 13, 2020. http://etd.lib.msu.edu/islandora/object/etd:40326.

MLA Handbook (7^{th} Edition):

Gibson, John Bryon, 1943-. “Optimal starting approximations for iterative schemes from classes of rational functions.” 1971. Web. 13 Aug 2020.

Vancouver:

Gibson, John Bryon 1. Optimal starting approximations for iterative schemes from classes of rational functions. [Internet] [Doctoral dissertation]. Michigan State University; 1971. [cited 2020 Aug 13]. Available from: http://etd.lib.msu.edu/islandora/object/etd:40326.

Council of Science Editors:

Gibson, John Bryon 1. Optimal starting approximations for iterative schemes from classes of rational functions. [Doctoral Dissertation]. Michigan State University; 1971. Available from: http://etd.lib.msu.edu/islandora/object/etd:40326

University of Melbourne

28.
Jegaraj, Terence.
Polynomial birth-death *approximation* of pattern occurrences in an independent, identically distributed sequence.

Degree: 2003, University of Melbourne

URL: http://hdl.handle.net/11343/39506

The distribution of occurrences of a non–overlapping pattern in an independent,identically distributed sequence can be approximated well by some two–parameterpolynomial birth–death distributions, at least when the pattern probability is small.The total variation distance error can be shown to approach zero as the length ofthe sequence being considered increases.

Subjects/Keywords: polynomials; approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Jegaraj, T. (2003). Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/39506

Chicago Manual of Style (16^{th} Edition):

Jegaraj, Terence. “Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence.” 2003. Masters Thesis, University of Melbourne. Accessed August 13, 2020. http://hdl.handle.net/11343/39506.

MLA Handbook (7^{th} Edition):

Jegaraj, Terence. “Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence.” 2003. Web. 13 Aug 2020.

Vancouver:

Jegaraj T. Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence. [Internet] [Masters thesis]. University of Melbourne; 2003. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/11343/39506.

Council of Science Editors:

Jegaraj T. Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence. [Masters Thesis]. University of Melbourne; 2003. Available from: http://hdl.handle.net/11343/39506

Texas Tech University

29.
Whitmore, Roy Walter.
Monotonio polynomial * approximation*.

Degree: Mathematics, 1971, Texas Tech University

URL: http://hdl.handle.net/2346/19402

Subjects/Keywords: Polynomials; Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Whitmore, R. W. (1971). Monotonio polynomial approximation. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/19402

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Whitmore, Roy Walter. “Monotonio polynomial approximation.” 1971. Thesis, Texas Tech University. Accessed August 13, 2020. http://hdl.handle.net/2346/19402.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Whitmore, Roy Walter. “Monotonio polynomial approximation.” 1971. Web. 13 Aug 2020.

Vancouver:

Whitmore RW. Monotonio polynomial approximation. [Internet] [Thesis]. Texas Tech University; 1971. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/2346/19402.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Whitmore RW. Monotonio polynomial approximation. [Thesis]. Texas Tech University; 1971. Available from: http://hdl.handle.net/2346/19402

Not specified: Masters Thesis or Doctoral Dissertation

Texas Tech University

30. Coberly, William Arthur. On Edgeworth expansions with unknown cumulants.

Degree: Mathematics, 1972, Texas Tech University

URL: http://hdl.handle.net/2346/17530

Subjects/Keywords: Interpolation; Approximation theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Coberly, W. A. (1972). On Edgeworth expansions with unknown cumulants. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/17530

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Coberly, William Arthur. “On Edgeworth expansions with unknown cumulants.” 1972. Thesis, Texas Tech University. Accessed August 13, 2020. http://hdl.handle.net/2346/17530.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Coberly, William Arthur. “On Edgeworth expansions with unknown cumulants.” 1972. Web. 13 Aug 2020.

Vancouver:

Coberly WA. On Edgeworth expansions with unknown cumulants. [Internet] [Thesis]. Texas Tech University; 1972. [cited 2020 Aug 13]. Available from: http://hdl.handle.net/2346/17530.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Coberly WA. On Edgeworth expansions with unknown cumulants. [Thesis]. Texas Tech University; 1972. Available from: http://hdl.handle.net/2346/17530

Not specified: Masters Thesis or Doctoral Dissertation