Advanced search options

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

You searched for `subject:(numerical algorithms)`

.
Showing records 1 – 30 of
214 total matches.

◁ [1] [2] [3] [4] [5] [6] [7] [8] ▶

Search Limiters

Dates

- 2015 – 2019 (72)
- 2010 – 2014 (74)
- 2005 – 2009 (34)
- 2000 – 2004 (20)

Universities

- University of Oxford (16)
- Georgia Tech (11)

Degrees

- PhD (59)
- MS (20)
- Docteur es (11)

▼ Search Limiters

1. Hilbert, Christopher B. Tetrahedral mesh optimization and generation via topological transformations and gradient based node perturbation.

Degree: 2015, University of Tennessee – Chattanooga

URL: https://scholar.utc.edu/theses/185

► A general tetrahedral mesh optimization scheme utilizing both topological changes (i.e. flips) and gradient-based vertex optimization (i.e. smoothing) is demonstrated. This scheme is used in…
(more)

Subjects/Keywords: Numerical grid generation (Numerical analysis); Computer algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hilbert, C. B. (2015). Tetrahedral mesh optimization and generation via topological transformations and gradient based node perturbation. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/185

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

Hilbert, Christopher B. “Tetrahedral mesh optimization and generation via topological transformations and gradient based node perturbation.” 2015. Masters Thesis, University of Tennessee – Chattanooga. Accessed December 08, 2019. https://scholar.utc.edu/theses/185.

MLA Handbook (7^{th} Edition):

Hilbert, Christopher B. “Tetrahedral mesh optimization and generation via topological transformations and gradient based node perturbation.” 2015. Web. 08 Dec 2019.

Vancouver:

Hilbert CB. Tetrahedral mesh optimization and generation via topological transformations and gradient based node perturbation. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2015. [cited 2019 Dec 08]. Available from: https://scholar.utc.edu/theses/185.

Council of Science Editors:

Hilbert CB. Tetrahedral mesh optimization and generation via topological transformations and gradient based node perturbation. [Masters Thesis]. University of Tennessee – Chattanooga; 2015. Available from: https://scholar.utc.edu/theses/185

2. Betro, Vincent Charles. Fully anisotropic split-tree adaptive refinement mesh generation using tetrahedral mesh stitching.

Degree: 2010, University of Tennessee – Chattanooga

URL: https://scholar.utc.edu/theses/197

► Due to the myriad of geometric topologies that modern computational fluid dynamicists desire to mesh and run solutions on, the need for a robust Cartesian…
(more)

Subjects/Keywords: Numerical grid generation (Numerical analysis); Computer algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Betro, V. C. (2010). Fully anisotropic split-tree adaptive refinement mesh generation using tetrahedral mesh stitching. (Doctoral Dissertation). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/197

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

Betro, Vincent Charles. “Fully anisotropic split-tree adaptive refinement mesh generation using tetrahedral mesh stitching.” 2010. Doctoral Dissertation, University of Tennessee – Chattanooga. Accessed December 08, 2019. https://scholar.utc.edu/theses/197.

MLA Handbook (7^{th} Edition):

Betro, Vincent Charles. “Fully anisotropic split-tree adaptive refinement mesh generation using tetrahedral mesh stitching.” 2010. Web. 08 Dec 2019.

Vancouver:

Betro VC. Fully anisotropic split-tree adaptive refinement mesh generation using tetrahedral mesh stitching. [Internet] [Doctoral dissertation]. University of Tennessee – Chattanooga; 2010. [cited 2019 Dec 08]. Available from: https://scholar.utc.edu/theses/197.

Council of Science Editors:

Betro VC. Fully anisotropic split-tree adaptive refinement mesh generation using tetrahedral mesh stitching. [Doctoral Dissertation]. University of Tennessee – Chattanooga; 2010. Available from: https://scholar.utc.edu/theses/197

Georgia Tech

3.
Krone, Robert Carlton.
Symmetric ideals and *numerical* primary decomposition.

Degree: PhD, Mathematics, 2015, Georgia Tech

URL: http://hdl.handle.net/1853/53907

► The thesis considers two distinct strategies for algebraic computation with polynomials in high dimension. The first concerns ideals and varieties with symmetry, which often arise…
(more)

Subjects/Keywords: Numerical algebraic geometry; Commutative algebra; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krone, R. C. (2015). Symmetric ideals and numerical primary decomposition. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53907

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

Krone, Robert Carlton. “Symmetric ideals and numerical primary decomposition.” 2015. Doctoral Dissertation, Georgia Tech. Accessed December 08, 2019. http://hdl.handle.net/1853/53907.

MLA Handbook (7^{th} Edition):

Krone, Robert Carlton. “Symmetric ideals and numerical primary decomposition.” 2015. Web. 08 Dec 2019.

Vancouver:

Krone RC. Symmetric ideals and numerical primary decomposition. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1853/53907.

Council of Science Editors:

Krone RC. Symmetric ideals and numerical primary decomposition. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53907

Cornell University

4.
Popov, Pavel.
Advances In Particle/Finite Volume *Algorithms* For Turbulent Reactive Flows
.

Degree: 2013, Cornell University

URL: http://hdl.handle.net/1813/33920

► In the field of turbulent reactive flow simulations, hybrid particle/finite volume large eddy simulation/probability density function (LES/PDF) methods have been shown to be highly accurate…
(more)

Subjects/Keywords: numerical algorithms; turbulent reactive flows; stochastic simulation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Popov, P. (2013). Advances In Particle/Finite Volume Algorithms For Turbulent Reactive Flows . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/33920

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):

Popov, Pavel. “Advances In Particle/Finite Volume Algorithms For Turbulent Reactive Flows .” 2013. Thesis, Cornell University. Accessed December 08, 2019. http://hdl.handle.net/1813/33920.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Popov, Pavel. “Advances In Particle/Finite Volume Algorithms For Turbulent Reactive Flows .” 2013. Web. 08 Dec 2019.

Vancouver:

Popov P. Advances In Particle/Finite Volume Algorithms For Turbulent Reactive Flows . [Internet] [Thesis]. Cornell University; 2013. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1813/33920.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Popov P. Advances In Particle/Finite Volume Algorithms For Turbulent Reactive Flows . [Thesis]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/33920

Not specified: Masters Thesis or Doctoral Dissertation

Université Catholique de Louvain

5. Miled, Bilel. Coupled viscoelastic-viscoplastic modeling of homogeneous and reinforced thermoplastic polymers.

Degree: 2011, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/94333

►

Glass fiber reinforced thermoplastics are widely used in structural applications because of their high stiffness and failure stress. However, controlling their complex mechanical behavior must… (more)

Subjects/Keywords: Homogenization; Viscoelasticity; Viscoplasticity; Numerical algorithms; Micromechanics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Miled, B. (2011). Coupled viscoelastic-viscoplastic modeling of homogeneous and reinforced thermoplastic polymers. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/94333

Not specified: Masters Thesis or Doctoral Dissertation

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

Miled, Bilel. “Coupled viscoelastic-viscoplastic modeling of homogeneous and reinforced thermoplastic polymers.” 2011. Thesis, Université Catholique de Louvain. Accessed December 08, 2019. http://hdl.handle.net/2078.1/94333.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Miled, Bilel. “Coupled viscoelastic-viscoplastic modeling of homogeneous and reinforced thermoplastic polymers.” 2011. Web. 08 Dec 2019.

Vancouver:

Miled B. Coupled viscoelastic-viscoplastic modeling of homogeneous and reinforced thermoplastic polymers. [Internet] [Thesis]. Université Catholique de Louvain; 2011. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/2078.1/94333.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Miled B. Coupled viscoelastic-viscoplastic modeling of homogeneous and reinforced thermoplastic polymers. [Thesis]. Université Catholique de Louvain; 2011. Available from: http://hdl.handle.net/2078.1/94333

Not specified: Masters Thesis or Doctoral Dissertation

University of British Columbia

6. Wright, Lois E. An information theoretic measure of algorithmic complexity .

Degree: 1974, University of British Columbia

URL: http://hdl.handle.net/2429/19034

► This work is a study of an information theoretic model which is used to develop a complexity measure of an algorithm. The measure is defined…
(more)

Subjects/Keywords: Algorithms; Numerical calculations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wright, L. E. (1974). An information theoretic measure of algorithmic complexity . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/19034

Not specified: Masters Thesis or Doctoral Dissertation

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

Wright, Lois E. “An information theoretic measure of algorithmic complexity .” 1974. Thesis, University of British Columbia. Accessed December 08, 2019. http://hdl.handle.net/2429/19034.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wright, Lois E. “An information theoretic measure of algorithmic complexity .” 1974. Web. 08 Dec 2019.

Vancouver:

Wright LE. An information theoretic measure of algorithmic complexity . [Internet] [Thesis]. University of British Columbia; 1974. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/2429/19034.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wright LE. An information theoretic measure of algorithmic complexity . [Thesis]. University of British Columbia; 1974. Available from: http://hdl.handle.net/2429/19034

Not specified: Masters Thesis or Doctoral Dissertation

University of Pennsylvania

7.
Fazlyab, Mahyar.
Control Theoretic Methods In Analysis And Design Of Optimization * Algorithms*.

Degree: 2018, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/3066

► Recently, there has been a surge of interest in incorporating tools from dynamical systems and control theory to analyze and design iterative optimization *algorithms*. This…
(more)

Subjects/Keywords: Iterative Algorithms; Numerical Optimization; Robust Control; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fazlyab, M. (2018). Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/3066

Not specified: Masters Thesis or Doctoral Dissertation

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

Fazlyab, Mahyar. “Control Theoretic Methods In Analysis And Design Of Optimization Algorithms.” 2018. Thesis, University of Pennsylvania. Accessed December 08, 2019. https://repository.upenn.edu/edissertations/3066.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fazlyab, Mahyar. “Control Theoretic Methods In Analysis And Design Of Optimization Algorithms.” 2018. Web. 08 Dec 2019.

Vancouver:

Fazlyab M. Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. [Internet] [Thesis]. University of Pennsylvania; 2018. [cited 2019 Dec 08]. Available from: https://repository.upenn.edu/edissertations/3066.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fazlyab M. Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. [Thesis]. University of Pennsylvania; 2018. Available from: https://repository.upenn.edu/edissertations/3066

Not specified: Masters Thesis or Doctoral Dissertation

Portland State University

8.
Shaw, Jeremy A.
Computational *Algorithms* for Improved Representation of the Model Error Covariance in Weak-Constraint 4D-Var.

Degree: PhD, Mathematics and Statistics, 2017, Portland State University

URL: https://pdxscholar.library.pdx.edu/open_access_etds/3473

► Four-dimensional variational data assimilation (4D-Var) provides an estimate to the state of a dynamical system through the minimization of a cost functional that measures…
(more)

Subjects/Keywords: Algorithms; Numerical analysis; Error analysis (Mathematics); Mathematics; Numerical Analysis and Computation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shaw, J. A. (2017). Computational Algorithms for Improved Representation of the Model Error Covariance in Weak-Constraint 4D-Var. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/3473

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

Shaw, Jeremy A. “Computational Algorithms for Improved Representation of the Model Error Covariance in Weak-Constraint 4D-Var.” 2017. Doctoral Dissertation, Portland State University. Accessed December 08, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/3473.

MLA Handbook (7^{th} Edition):

Shaw, Jeremy A. “Computational Algorithms for Improved Representation of the Model Error Covariance in Weak-Constraint 4D-Var.” 2017. Web. 08 Dec 2019.

Vancouver:

Shaw JA. Computational Algorithms for Improved Representation of the Model Error Covariance in Weak-Constraint 4D-Var. [Internet] [Doctoral dissertation]. Portland State University; 2017. [cited 2019 Dec 08]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/3473.

Council of Science Editors:

Shaw JA. Computational Algorithms for Improved Representation of the Model Error Covariance in Weak-Constraint 4D-Var. [Doctoral Dissertation]. Portland State University; 2017. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/3473

University of Manchester

9.
Kannan, Ramaseshan.
* Numerical* linear algebra problems in structural analysis.

Degree: PhD, 2014, University of Manchester

URL: https://www.research.manchester.ac.uk/portal/en/theses/numerical-linear-algebra-problems-in-structural-analysis(7df0f708-fc12-4807-a1f5-215960d9c4d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.632263

► A range of *numerical* linear algebra problems that arise in finite element-based structural analysis are considered. These problems were encountered when implementing the finite element…
(more)

Subjects/Keywords: 512; Numerical Linear Algebra, Sparse Matrix algorithms, Structural Analysis, Numerical conditioning, Parallel programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kannan, R. (2014). Numerical linear algebra problems in structural analysis. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/numerical-linear-algebra-problems-in-structural-analysis(7df0f708-fc12-4807-a1f5-215960d9c4d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.632263

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

Kannan, Ramaseshan. “Numerical linear algebra problems in structural analysis.” 2014. Doctoral Dissertation, University of Manchester. Accessed December 08, 2019. https://www.research.manchester.ac.uk/portal/en/theses/numerical-linear-algebra-problems-in-structural-analysis(7df0f708-fc12-4807-a1f5-215960d9c4d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.632263.

MLA Handbook (7^{th} Edition):

Kannan, Ramaseshan. “Numerical linear algebra problems in structural analysis.” 2014. Web. 08 Dec 2019.

Vancouver:

Kannan R. Numerical linear algebra problems in structural analysis. [Internet] [Doctoral dissertation]. University of Manchester; 2014. [cited 2019 Dec 08]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/numerical-linear-algebra-problems-in-structural-analysis(7df0f708-fc12-4807-a1f5-215960d9c4d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.632263.

Council of Science Editors:

Kannan R. Numerical linear algebra problems in structural analysis. [Doctoral Dissertation]. University of Manchester; 2014. Available from: https://www.research.manchester.ac.uk/portal/en/theses/numerical-linear-algebra-problems-in-structural-analysis(7df0f708-fc12-4807-a1f5-215960d9c4d4).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.632263

10. Emmerich, Michael T. M. Single- and multi-objective evolutionary design optimization assisted by gaussian random field metamodels.

Degree: 2005, Technische Universität Dortmund

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

► In this thesis *numerical* optimization methods for single- and multi-objective design optimization with time-consuming computer experiments are studied in theory and practise. We show that…
(more)

Subjects/Keywords: Computer experiments; Evolutionary algorithms; Kriging metamodels; Multicriteria optimization; Numerical optimization; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Emmerich, M. T. M. (2005). Single- and multi-objective evolutionary design optimization assisted by gaussian random field metamodels. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/21807

Not specified: Masters Thesis or Doctoral Dissertation

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

Emmerich, Michael T M. “Single- and multi-objective evolutionary design optimization assisted by gaussian random field metamodels.” 2005. Thesis, Technische Universität Dortmund. Accessed December 08, 2019. http://hdl.handle.net/2003/21807.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Emmerich, Michael T M. “Single- and multi-objective evolutionary design optimization assisted by gaussian random field metamodels.” 2005. Web. 08 Dec 2019.

Vancouver:

Emmerich MTM. Single- and multi-objective evolutionary design optimization assisted by gaussian random field metamodels. [Internet] [Thesis]. Technische Universität Dortmund; 2005. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/2003/21807.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Emmerich MTM. Single- and multi-objective evolutionary design optimization assisted by gaussian random field metamodels. [Thesis]. Technische Universität Dortmund; 2005. Available from: http://hdl.handle.net/2003/21807

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

11.
Kim, Kyungeun.
* Numerical* Methods for Uncertainty Analysis in Dynamical Systems.

Degree: 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151898

► The current methods for uncertainty analysis in dynamical systems are restricted in terms of computational cost and evaluation domain since they either use grid points…
(more)

Subjects/Keywords: Stochastic Systems; Uncertainty Analysis; Switched Systems; Numerical Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kim, K. (2013). Numerical Methods for Uncertainty Analysis in Dynamical Systems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151898

Not specified: Masters Thesis or Doctoral Dissertation

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

Kim, Kyungeun. “Numerical Methods for Uncertainty Analysis in Dynamical Systems.” 2013. Thesis, Texas A&M University. Accessed December 08, 2019. http://hdl.handle.net/1969.1/151898.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kim, Kyungeun. “Numerical Methods for Uncertainty Analysis in Dynamical Systems.” 2013. Web. 08 Dec 2019.

Vancouver:

Kim K. Numerical Methods for Uncertainty Analysis in Dynamical Systems. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1969.1/151898.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kim K. Numerical Methods for Uncertainty Analysis in Dynamical Systems. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151898

Not specified: Masters Thesis or Doctoral Dissertation

12. Allen, Daniel Robert. A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem.

Degree: MS, Computer Science, 2018, Eastern Washington University

URL: http://dc.ewu.edu/theses/470

► This thesis revisits the k-mismatch shortest unique substring (SUS) finding problem and demonstrates that a technique recently presented in the context of solving the…
(more)

Subjects/Keywords: Numerical Analysis and Scientific Computing; Other Computer Sciences; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Allen, D. R. (2018). A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem. (Thesis). Eastern Washington University. Retrieved from http://dc.ewu.edu/theses/470

Not specified: Masters Thesis or Doctoral Dissertation

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

Allen, Daniel Robert. “A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem.” 2018. Thesis, Eastern Washington University. Accessed December 08, 2019. http://dc.ewu.edu/theses/470.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Allen, Daniel Robert. “A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem.” 2018. Web. 08 Dec 2019.

Vancouver:

Allen DR. A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem. [Internet] [Thesis]. Eastern Washington University; 2018. [cited 2019 Dec 08]. Available from: http://dc.ewu.edu/theses/470.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Allen DR. A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem. [Thesis]. Eastern Washington University; 2018. Available from: http://dc.ewu.edu/theses/470

Not specified: Masters Thesis or Doctoral Dissertation

UCLA

13. Yousefi, Arman. Matrix Balancing in Lp Norms.

Degree: Computer Science, 2017, UCLA

URL: http://www.escholarship.org/uc/item/3847b5dr

► Matrix balancing is a preprocessing step in linear algebra computations such as the computation of eigenvalues of a matrix. Such computations are known to be…
(more)

Subjects/Keywords: Computer science; algorithms; convergence rate; matrix balancing; Numerical linear algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yousefi, A. (2017). Matrix Balancing in Lp Norms. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/3847b5dr

Not specified: Masters Thesis or Doctoral Dissertation

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

Yousefi, Arman. “Matrix Balancing in Lp Norms.” 2017. Thesis, UCLA. Accessed December 08, 2019. http://www.escholarship.org/uc/item/3847b5dr.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yousefi, Arman. “Matrix Balancing in Lp Norms.” 2017. Web. 08 Dec 2019.

Vancouver:

Yousefi A. Matrix Balancing in Lp Norms. [Internet] [Thesis]. UCLA; 2017. [cited 2019 Dec 08]. Available from: http://www.escholarship.org/uc/item/3847b5dr.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yousefi A. Matrix Balancing in Lp Norms. [Thesis]. UCLA; 2017. Available from: http://www.escholarship.org/uc/item/3847b5dr

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

14.
Solomonik, Edgar.
Provably Efficient *Algorithms* for *Numerical* Tensor Algebra.

Degree: Computer Science, 2014, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/00b4r0mv

► This thesis targets the design of parallelizable *algorithms* and communication-efficient parallel schedules for *numerical* linear algebra as well as computations with higher-order tensors. Communication is…
(more)

Subjects/Keywords: Computer science; numerical linear algebra; parallel algorithms; tensor computations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Solomonik, E. (2014). Provably Efficient Algorithms for Numerical Tensor Algebra. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/00b4r0mv

Not specified: Masters Thesis or Doctoral Dissertation

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

Solomonik, Edgar. “Provably Efficient Algorithms for Numerical Tensor Algebra.” 2014. Thesis, University of California – Berkeley. Accessed December 08, 2019. http://www.escholarship.org/uc/item/00b4r0mv.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Solomonik, Edgar. “Provably Efficient Algorithms for Numerical Tensor Algebra.” 2014. Web. 08 Dec 2019.

Vancouver:

Solomonik E. Provably Efficient Algorithms for Numerical Tensor Algebra. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2019 Dec 08]. Available from: http://www.escholarship.org/uc/item/00b4r0mv.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Solomonik E. Provably Efficient Algorithms for Numerical Tensor Algebra. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/00b4r0mv

Not specified: Masters Thesis or Doctoral Dissertation

Universitat Politècnica de València

15. Tung, Michael Ming-Sha. Spline approximations for systems of ordinary differential equations .

Degree: 2013, Universitat Politècnica de València

URL: http://hdl.handle.net/10251/31658

► El objetivo de esta tesis doctoral es desarrollar nuevos métodos basados en splines para la resolución de sistemas de ecuaciones diferenciales del tipo Y'(x)=f(x,Y(x)) ,…
(more)

Subjects/Keywords: Spline approximation; Numerical algorithms; Matrix differential equations; Initial value problems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tung, M. M. (2013). Spline approximations for systems of ordinary differential equations . (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/31658

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

Tung, Michael Ming-Sha. “Spline approximations for systems of ordinary differential equations .” 2013. Doctoral Dissertation, Universitat Politècnica de València. Accessed December 08, 2019. http://hdl.handle.net/10251/31658.

MLA Handbook (7^{th} Edition):

Tung, Michael Ming-Sha. “Spline approximations for systems of ordinary differential equations .” 2013. Web. 08 Dec 2019.

Vancouver:

Tung MM. Spline approximations for systems of ordinary differential equations . [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2013. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10251/31658.

Council of Science Editors:

Tung MM. Spline approximations for systems of ordinary differential equations . [Doctoral Dissertation]. Universitat Politècnica de València; 2013. Available from: http://hdl.handle.net/10251/31658

Florida Atlantic University

16. Kasti, Dinesh. An Algorithmic Approach to The Lattice Structures of Attractors and Lyapunov functions.

Degree: 2016, Florida Atlantic University

URL: http://purl.flvc.org/fau/fd/FA00004668

►

Summary: Ban and Kalies [3] proposed an algorithmic approach to compute attractor- repeller pairs and weak Lyapunov functions based on a combinatorial multivalued mapping derived… (more)

Subjects/Keywords: Differential equations – Numerical solutions.; Differentiable dynamical systems.; Algorithms.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kasti, D. (2016). An Algorithmic Approach to The Lattice Structures of Attractors and Lyapunov functions. (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004668

Not specified: Masters Thesis or Doctoral Dissertation

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

Kasti, Dinesh. “An Algorithmic Approach to The Lattice Structures of Attractors and Lyapunov functions.” 2016. Thesis, Florida Atlantic University. Accessed December 08, 2019. http://purl.flvc.org/fau/fd/FA00004668.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kasti, Dinesh. “An Algorithmic Approach to The Lattice Structures of Attractors and Lyapunov functions.” 2016. Web. 08 Dec 2019.

Vancouver:

Kasti D. An Algorithmic Approach to The Lattice Structures of Attractors and Lyapunov functions. [Internet] [Thesis]. Florida Atlantic University; 2016. [cited 2019 Dec 08]. Available from: http://purl.flvc.org/fau/fd/FA00004668.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kasti D. An Algorithmic Approach to The Lattice Structures of Attractors and Lyapunov functions. [Thesis]. Florida Atlantic University; 2016. Available from: http://purl.flvc.org/fau/fd/FA00004668

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

17.
Fairbanks, James Paul.
Graph analysis combining *numerical*, statistical, and streaming techniques.

Degree: PhD, Computational Science and Engineering, 2016, Georgia Tech

URL: http://hdl.handle.net/1853/54972

► Graph analysis uses graph data collected on a physical, biological, or social phenomena to shed light on the underlying dynamics and behavior of the agents…
(more)

Subjects/Keywords: Graph analysis; Graph algorithms; Data analysis; Spectral clustering; Numerical analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fairbanks, J. P. (2016). Graph analysis combining numerical, statistical, and streaming techniques. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54972

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

Fairbanks, James Paul. “Graph analysis combining numerical, statistical, and streaming techniques.” 2016. Doctoral Dissertation, Georgia Tech. Accessed December 08, 2019. http://hdl.handle.net/1853/54972.

MLA Handbook (7^{th} Edition):

Fairbanks, James Paul. “Graph analysis combining numerical, statistical, and streaming techniques.” 2016. Web. 08 Dec 2019.

Vancouver:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1853/54972.

Council of Science Editors:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/54972

University of California – Berkeley

18. Hoemmen, Mark. Communication-avoiding Krylov subspace methods.

Degree: Computer Science, 2010, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/7757521k

► The cost of an algorithm includes both arithmetic and communication.We use "communication" in a general sense to mean data movement,either between levels of a memory…
(more)

Subjects/Keywords: Computer Science; Mathematics; communication-avoiding algorithms; iterative methods; linear algebra; numerical methods; parallel algorithms; sparse matrices

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hoemmen, M. (2010). Communication-avoiding Krylov subspace methods. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7757521k

Not specified: Masters Thesis or Doctoral Dissertation

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

Hoemmen, Mark. “Communication-avoiding Krylov subspace methods.” 2010. Thesis, University of California – Berkeley. Accessed December 08, 2019. http://www.escholarship.org/uc/item/7757521k.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hoemmen, Mark. “Communication-avoiding Krylov subspace methods.” 2010. Web. 08 Dec 2019.

Vancouver:

Hoemmen M. Communication-avoiding Krylov subspace methods. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2019 Dec 08]. Available from: http://www.escholarship.org/uc/item/7757521k.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hoemmen M. Communication-avoiding Krylov subspace methods. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/7757521k

Not specified: Masters Thesis or Doctoral Dissertation

19. Πεταλάς, Ιωάννης. Μιμιδικοί και εξελικτικοί αλγόριθμοι στην αριθμητική βελτιστοποίηση και στη μη γραμμική δυναμική.

Degree: 2008, University of Patras

URL: http://nemertes.lis.upatras.gr/jspui/handle/10889/942

►

Το κύριο στοιχείο της διατριβής είναι οι Εξελικτικοί Αλγόριθμοι. Στο πρώτο μέρος παρουσιάζονται οι Μιμιδικοί Αλγόριθμοι. Οι Μιμιδικοί Αλγόριθμοι είναι υβριδικά σχήματα που συνδυάζουν τους… (more)

Subjects/Keywords: Αριθμητική βελτιστοποίηση; Εξελικτικοί αλγόριθμοι; Μιμιδικοί αλγόριθμοι; Συμπλεκτικές απεικονίσεις; Περιοδικές τροχιές; 511.8; Numerical optimization; Evolutionary algorithms; Memetic algorithms; Symplectic maps; Periodic orbits

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Πεταλάς, . (2008). Μιμιδικοί και εξελικτικοί αλγόριθμοι στην αριθμητική βελτιστοποίηση και στη μη γραμμική δυναμική. (Doctoral Dissertation). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/942

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

Πεταλάς, Ιωάννης. “Μιμιδικοί και εξελικτικοί αλγόριθμοι στην αριθμητική βελτιστοποίηση και στη μη γραμμική δυναμική.” 2008. Doctoral Dissertation, University of Patras. Accessed December 08, 2019. http://nemertes.lis.upatras.gr/jspui/handle/10889/942.

MLA Handbook (7^{th} Edition):

Πεταλάς, Ιωάννης. “Μιμιδικοί και εξελικτικοί αλγόριθμοι στην αριθμητική βελτιστοποίηση και στη μη γραμμική δυναμική.” 2008. Web. 08 Dec 2019.

Vancouver:

Πεταλάς . Μιμιδικοί και εξελικτικοί αλγόριθμοι στην αριθμητική βελτιστοποίηση και στη μη γραμμική δυναμική. [Internet] [Doctoral dissertation]. University of Patras; 2008. [cited 2019 Dec 08]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/942.

Council of Science Editors:

Πεταλάς . Μιμιδικοί και εξελικτικοί αλγόριθμοι στην αριθμητική βελτιστοποίηση και στη μη γραμμική δυναμική. [Doctoral Dissertation]. University of Patras; 2008. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/942

University of Oxford

20.
Wei, Ke.
Efficient *algorithms* for compressed sensing and matrix completion.

Degree: PhD, 2014, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627829

► Compressed sensing and matrix completion are two new data acquisition techniques whose efficiency is achieved by exploring low dimensional structures in high dimensional data. Despite…
(more)

Subjects/Keywords: 518; Numerical analysis; numerical algorithms; low per iteration complexity; hard thresholding; alternating minimization; compressed sensing; matrix completion

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wei, K. (2014). Efficient algorithms for compressed sensing and matrix completion. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627829

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

Wei, Ke. “Efficient algorithms for compressed sensing and matrix completion.” 2014. Doctoral Dissertation, University of Oxford. Accessed December 08, 2019. http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627829.

MLA Handbook (7^{th} Edition):

Wei, Ke. “Efficient algorithms for compressed sensing and matrix completion.” 2014. Web. 08 Dec 2019.

Vancouver:

Wei K. Efficient algorithms for compressed sensing and matrix completion. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Dec 08]. Available from: http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627829.

Council of Science Editors:

Wei K. Efficient algorithms for compressed sensing and matrix completion. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627829

21. Barker, Mary A. The development of an all quadrilateral boundary conforming grid generator for high order finite element methods.

Degree: 2015, University of Tennessee – Chattanooga

URL: https://scholar.utc.edu/theses/434

► A grid generator is developed that produces all quadrilateral meshes. The scheme is automated to work for arbitrary choice of geometry. In addition, a Non-Uniform…
(more)

Subjects/Keywords: Numerical grid generation (Numerical analysis); Computer algorithms

…quadrilaterals that fall on a boundary.
Higher order Finite Element solution *algorithms* promise… …finite volume formulations. However, the convergence rate of these *algorithms* is highly…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Barker, M. A. (2015). The development of an all quadrilateral boundary conforming grid generator for high order finite element methods. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/434

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

Barker, Mary A. “The development of an all quadrilateral boundary conforming grid generator for high order finite element methods.” 2015. Masters Thesis, University of Tennessee – Chattanooga. Accessed December 08, 2019. https://scholar.utc.edu/theses/434.

MLA Handbook (7^{th} Edition):

Barker, Mary A. “The development of an all quadrilateral boundary conforming grid generator for high order finite element methods.” 2015. Web. 08 Dec 2019.

Vancouver:

Barker MA. The development of an all quadrilateral boundary conforming grid generator for high order finite element methods. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2015. [cited 2019 Dec 08]. Available from: https://scholar.utc.edu/theses/434.

Council of Science Editors:

Barker MA. The development of an all quadrilateral boundary conforming grid generator for high order finite element methods. [Masters Thesis]. University of Tennessee – Chattanooga; 2015. Available from: https://scholar.utc.edu/theses/434

University of Manchester

22. Zhang, Weijian. Evolving Graphs and Similarity-based Graphs with Applications.

Degree: 2018, University of Manchester

URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:317287

► A graph is a mathematical structure for modelling the pairwise relations between objects. This thesis studies two types of graphs, namely, similarity-based graphs and evolving…
(more)

Subjects/Keywords: Evolving graphs; Network sciences; Time-dependent networks; Graph centrality; Knowledge graph; Natural language processing; Numerical algorithms; Numerical linear algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, W. (2018). Evolving Graphs and Similarity-based Graphs with Applications. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:317287

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

Zhang, Weijian. “Evolving Graphs and Similarity-based Graphs with Applications.” 2018. Doctoral Dissertation, University of Manchester. Accessed December 08, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:317287.

MLA Handbook (7^{th} Edition):

Zhang, Weijian. “Evolving Graphs and Similarity-based Graphs with Applications.” 2018. Web. 08 Dec 2019.

Vancouver:

Zhang W. Evolving Graphs and Similarity-based Graphs with Applications. [Internet] [Doctoral dissertation]. University of Manchester; 2018. [cited 2019 Dec 08]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:317287.

Council of Science Editors:

Zhang W. Evolving Graphs and Similarity-based Graphs with Applications. [Doctoral Dissertation]. University of Manchester; 2018. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:317287

University of Manchester

23. Zhang, Weijian. Evolving graphs and similarity-based graphs with applications.

Degree: PhD, 2018, University of Manchester

URL: https://www.research.manchester.ac.uk/portal/en/theses/evolving-graphs-and-similaritybased-graphs-with-applications(66a23d3d-1ad0-454b-9ba0-175b566af95d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764634

► A graph is a mathematical structure for modelling the pairwise relations between objects. This thesis studies two types of graphs, namely, similarity-based graphs and evolving…
(more)

Subjects/Keywords: 510; Numerical linear algebra; Numerical algorithms; Natural language processing; Knowledge graph; Time-dependent networks; Network sciences; Evolving graphs; Graph centrality

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, W. (2018). Evolving graphs and similarity-based graphs with applications. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/evolving-graphs-and-similaritybased-graphs-with-applications(66a23d3d-1ad0-454b-9ba0-175b566af95d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764634

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

Zhang, Weijian. “Evolving graphs and similarity-based graphs with applications.” 2018. Doctoral Dissertation, University of Manchester. Accessed December 08, 2019. https://www.research.manchester.ac.uk/portal/en/theses/evolving-graphs-and-similaritybased-graphs-with-applications(66a23d3d-1ad0-454b-9ba0-175b566af95d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764634.

MLA Handbook (7^{th} Edition):

Zhang, Weijian. “Evolving graphs and similarity-based graphs with applications.” 2018. Web. 08 Dec 2019.

Vancouver:

Zhang W. Evolving graphs and similarity-based graphs with applications. [Internet] [Doctoral dissertation]. University of Manchester; 2018. [cited 2019 Dec 08]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/evolving-graphs-and-similaritybased-graphs-with-applications(66a23d3d-1ad0-454b-9ba0-175b566af95d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764634.

Council of Science Editors:

Zhang W. Evolving graphs and similarity-based graphs with applications. [Doctoral Dissertation]. University of Manchester; 2018. Available from: https://www.research.manchester.ac.uk/portal/en/theses/evolving-graphs-and-similaritybased-graphs-with-applications(66a23d3d-1ad0-454b-9ba0-175b566af95d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.764634

Curtin University of Technology

24. Chayantrakom, Kittisak. Mathematical modelling of particle-fluid flows in microchannels .

Degree: 2009, Curtin University of Technology

URL: http://hdl.handle.net/20.500.11937/1115

► Flows of fluids and solid particles through microchannels have a very wide range of applications in biological and medical science and engineering. Understanding the mechanism…
(more)

Subjects/Keywords: analytical methods; numerical investigation; mathematical models; biological science; engineering; numerical algorithms; flows; medical science; microflows; fluids; microchannels; solid particles

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chayantrakom, K. (2009). Mathematical modelling of particle-fluid flows in microchannels . (Thesis). Curtin University of Technology. Retrieved from http://hdl.handle.net/20.500.11937/1115

Not specified: Masters Thesis or Doctoral Dissertation

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

Chayantrakom, Kittisak. “Mathematical modelling of particle-fluid flows in microchannels .” 2009. Thesis, Curtin University of Technology. Accessed December 08, 2019. http://hdl.handle.net/20.500.11937/1115.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chayantrakom, Kittisak. “Mathematical modelling of particle-fluid flows in microchannels .” 2009. Web. 08 Dec 2019.

Vancouver:

Chayantrakom K. Mathematical modelling of particle-fluid flows in microchannels . [Internet] [Thesis]. Curtin University of Technology; 2009. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/20.500.11937/1115.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chayantrakom K. Mathematical modelling of particle-fluid flows in microchannels . [Thesis]. Curtin University of Technology; 2009. Available from: http://hdl.handle.net/20.500.11937/1115

Not specified: Masters Thesis or Doctoral Dissertation

25.
Sutherland, David C. (David Craig).
* Algorithms* of Schensted and Hillman-Grassl and Operations on Standard Bitableaux.

Degree: 1983, North Texas State University

URL: https://digital.library.unt.edu/ark:/67531/metadc503902/

► In this thesis, we describe Schensted's algorithm for finding the length of a longest increasing subsequence of a finite sequence. Schensted's algorithm also constructs a…
(more)

Subjects/Keywords: Schensted's algorithm; natural numbers; numerical analysis; Algorithms.; Numerical analysis.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sutherland, D. C. (. C. (1983). Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux. (Thesis). North Texas State University. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc503902/

Not specified: Masters Thesis or Doctoral Dissertation

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

Sutherland, David C (David Craig). “Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux.” 1983. Thesis, North Texas State University. Accessed December 08, 2019. https://digital.library.unt.edu/ark:/67531/metadc503902/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sutherland, David C (David Craig). “Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux.” 1983. Web. 08 Dec 2019.

Vancouver:

Sutherland DC(C. Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux. [Internet] [Thesis]. North Texas State University; 1983. [cited 2019 Dec 08]. Available from: https://digital.library.unt.edu/ark:/67531/metadc503902/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sutherland DC(C. Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux. [Thesis]. North Texas State University; 1983. Available from: https://digital.library.unt.edu/ark:/67531/metadc503902/

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

26.
Saacks, Marguerite Elizabeth.
New quadrature formulas designed for use in adaptive * algorithms*.

Degree: MS, mathematics, 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-1981-THESIS-S111

Subjects/Keywords: mathematics.; Major mathematics.; Numerical integration.; Algorithms.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Saacks, M. E. (2012). New quadrature formulas designed for use in adaptive algorithms. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1981-THESIS-S111

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

Saacks, Marguerite Elizabeth. “New quadrature formulas designed for use in adaptive algorithms.” 2012. Masters Thesis, Texas A&M University. Accessed December 08, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1981-THESIS-S111.

MLA Handbook (7^{th} Edition):

Saacks, Marguerite Elizabeth. “New quadrature formulas designed for use in adaptive algorithms.” 2012. Web. 08 Dec 2019.

Vancouver:

Saacks ME. New quadrature formulas designed for use in adaptive algorithms. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1981-THESIS-S111.

Council of Science Editors:

Saacks ME. New quadrature formulas designed for use in adaptive algorithms. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1981-THESIS-S111

University of Oxford

27. Baluwala, Habib. Physically motivated registration of diagnostic CT and PET/CT of lung volumes.

Degree: PhD, 2013, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:797c00c0-1efa-43e2-8268-e3d09ced0e06 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581337

► Lung cancer is a disease affecting millions of people every year and poses a serious threat to global public health. Accurate lung cancer staging is…
(more)

Subjects/Keywords: 616.99424; Applications and algorithms; Numerical analysis; Biomedical engineering; Image understanding; Medical Engineering; Image registration

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Baluwala, H. (2013). Physically motivated registration of diagnostic CT and PET/CT of lung volumes. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:797c00c0-1efa-43e2-8268-e3d09ced0e06 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581337

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

Baluwala, Habib. “Physically motivated registration of diagnostic CT and PET/CT of lung volumes.” 2013. Doctoral Dissertation, University of Oxford. Accessed December 08, 2019. http://ora.ox.ac.uk/objects/uuid:797c00c0-1efa-43e2-8268-e3d09ced0e06 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581337.

MLA Handbook (7^{th} Edition):

Baluwala, Habib. “Physically motivated registration of diagnostic CT and PET/CT of lung volumes.” 2013. Web. 08 Dec 2019.

Vancouver:

Baluwala H. Physically motivated registration of diagnostic CT and PET/CT of lung volumes. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2019 Dec 08]. Available from: http://ora.ox.ac.uk/objects/uuid:797c00c0-1efa-43e2-8268-e3d09ced0e06 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581337.

Council of Science Editors:

Baluwala H. Physically motivated registration of diagnostic CT and PET/CT of lung volumes. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:797c00c0-1efa-43e2-8268-e3d09ced0e06 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581337

Texas A&M University

28. Konduri, Aditya. Highly Scalable Asynchronous Computing Method for Partial Differential Equations: A Path Towards Exascale.

Degree: 2016, Texas A&M University

URL: http://hdl.handle.net/1969.1/156951

► Many natural and engineering systems are governed by nonlinear partial differential equations (PDEs) which result in a multiscale phenomena, e.g. turbulent flows. *Numerical* simulations of…
(more)

Subjects/Keywords: asynchronous computing; computational fluid dynamics; partial differential equations; high performance computing; numerical algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Konduri, A. (2016). Highly Scalable Asynchronous Computing Method for Partial Differential Equations: A Path Towards Exascale. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156951

Not specified: Masters Thesis or Doctoral Dissertation

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

Konduri, Aditya. “Highly Scalable Asynchronous Computing Method for Partial Differential Equations: A Path Towards Exascale.” 2016. Thesis, Texas A&M University. Accessed December 08, 2019. http://hdl.handle.net/1969.1/156951.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Konduri, Aditya. “Highly Scalable Asynchronous Computing Method for Partial Differential Equations: A Path Towards Exascale.” 2016. Web. 08 Dec 2019.

Vancouver:

Konduri A. Highly Scalable Asynchronous Computing Method for Partial Differential Equations: A Path Towards Exascale. [Internet] [Thesis]. Texas A&M University; 2016. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1969.1/156951.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Konduri A. Highly Scalable Asynchronous Computing Method for Partial Differential Equations: A Path Towards Exascale. [Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/156951

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

29.
Lam, Yan-yan.
* Algorithms* for the minimum cost flow problem.

Degree: M. Phil., 2004, University of Hong Kong

URL: Lam, Y. [林欣欣]. (2004). Algorithms for the minimum cost flow problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3024605 ; http://dx.doi.org/10.5353/th_b3024605 ; http://hdl.handle.net/10722/31838

abstract

toc

published_or_final_version

Mathematics

Master

Master of Philosophy

Subjects/Keywords: Algorithms.; Network analysis (Planning); Numerical analysis.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lam, Y. (2004). Algorithms for the minimum cost flow problem. (Masters Thesis). University of Hong Kong. Retrieved from Lam, Y. [林欣欣]. (2004). Algorithms for the minimum cost flow problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3024605 ; http://dx.doi.org/10.5353/th_b3024605 ; http://hdl.handle.net/10722/31838

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

Lam, Yan-yan. “Algorithms for the minimum cost flow problem.” 2004. Masters Thesis, University of Hong Kong. Accessed December 08, 2019. Lam, Y. [林欣欣]. (2004). Algorithms for the minimum cost flow problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3024605 ; http://dx.doi.org/10.5353/th_b3024605 ; http://hdl.handle.net/10722/31838.

MLA Handbook (7^{th} Edition):

Lam, Yan-yan. “Algorithms for the minimum cost flow problem.” 2004. Web. 08 Dec 2019.

Vancouver:

Lam Y. Algorithms for the minimum cost flow problem. [Internet] [Masters thesis]. University of Hong Kong; 2004. [cited 2019 Dec 08]. Available from: Lam, Y. [林欣欣]. (2004). Algorithms for the minimum cost flow problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3024605 ; http://dx.doi.org/10.5353/th_b3024605 ; http://hdl.handle.net/10722/31838.

Council of Science Editors:

Lam Y. Algorithms for the minimum cost flow problem. [Masters Thesis]. University of Hong Kong; 2004. Available from: Lam, Y. [林欣欣]. (2004). Algorithms for the minimum cost flow problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3024605 ; http://dx.doi.org/10.5353/th_b3024605 ; http://hdl.handle.net/10722/31838

30. McDermott, Daniel. Evaluating a Cluster of Low-Power ARM64 Single-Board Computers with MapReduce.

Degree: MS, Computer Science, 2018, Eastern Washington University

URL: http://dc.ewu.edu/theses/474

► With the meteoric rise of enormous data collection in science, industry, and the cloud, methods for processing massive datasets have become more crucial than…
(more)

Subjects/Keywords: Databases and Information Systems; Numerical Analysis and Scientific Computing; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

McDermott, D. (2018). Evaluating a Cluster of Low-Power ARM64 Single-Board Computers with MapReduce. (Thesis). Eastern Washington University. Retrieved from http://dc.ewu.edu/theses/474

Not specified: Masters Thesis or Doctoral Dissertation

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

McDermott, Daniel. “Evaluating a Cluster of Low-Power ARM64 Single-Board Computers with MapReduce.” 2018. Thesis, Eastern Washington University. Accessed December 08, 2019. http://dc.ewu.edu/theses/474.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

McDermott, Daniel. “Evaluating a Cluster of Low-Power ARM64 Single-Board Computers with MapReduce.” 2018. Web. 08 Dec 2019.

Vancouver:

McDermott D. Evaluating a Cluster of Low-Power ARM64 Single-Board Computers with MapReduce. [Internet] [Thesis]. Eastern Washington University; 2018. [cited 2019 Dec 08]. Available from: http://dc.ewu.edu/theses/474.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

McDermott D. Evaluating a Cluster of Low-Power ARM64 Single-Board Computers with MapReduce. [Thesis]. Eastern Washington University; 2018. Available from: http://dc.ewu.edu/theses/474

Not specified: Masters Thesis or Doctoral Dissertation