Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Colorado" +contributor:("Gunnar Martinsson"). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Colorado

1. Young, Patrick McKendree. Numerical Techniques for the Solution of Partial Differential and Integral Equations on Irregular Domains with Applications to Problems in Electrowetting.

Degree: PhD, Applied Mathematics, 2010, University of Colorado

  Digital microfluidics is a rapidly growing field wherein droplets are manipulated for use in small-scale applications such as variable focus lenses, display technology, fiber… (more)

Subjects/Keywords: Dielectrophoresis; Digital Microfluidics; Digitized Heat Transfer; Electrowetting; Immersed Boundary Methods; Integral Equations; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Young, P. M. (2010). Numerical Techniques for the Solution of Partial Differential and Integral Equations on Irregular Domains with Applications to Problems in Electrowetting. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/8

Chicago Manual of Style (16th Edition):

Young, Patrick McKendree. “Numerical Techniques for the Solution of Partial Differential and Integral Equations on Irregular Domains with Applications to Problems in Electrowetting.” 2010. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/8.

MLA Handbook (7th Edition):

Young, Patrick McKendree. “Numerical Techniques for the Solution of Partial Differential and Integral Equations on Irregular Domains with Applications to Problems in Electrowetting.” 2010. Web. 07 Mar 2021.

Vancouver:

Young PM. Numerical Techniques for the Solution of Partial Differential and Integral Equations on Irregular Domains with Applications to Problems in Electrowetting. [Internet] [Doctoral dissertation]. University of Colorado; 2010. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/8.

Council of Science Editors:

Young PM. Numerical Techniques for the Solution of Partial Differential and Integral Equations on Irregular Domains with Applications to Problems in Electrowetting. [Doctoral Dissertation]. University of Colorado; 2010. Available from: https://scholar.colorado.edu/appm_gradetds/8


University of Colorado

2. Gillman, Adrianna. Fast Direct Solvers for Elliptic Partial Differential Equations.

Degree: PhD, Applied Mathematics, 2011, University of Colorado

  The dissertation describes fast, robust, and highly accurate numerical methods for solving boundary value problems associated with elliptic PDEs such as Laplace's and Helmholtz'… (more)

Subjects/Keywords: Fast methods; Linear algebra; Numerical Analysis; Partial Differential Equations; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gillman, A. (2011). Fast Direct Solvers for Elliptic Partial Differential Equations. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/20

Chicago Manual of Style (16th Edition):

Gillman, Adrianna. “Fast Direct Solvers for Elliptic Partial Differential Equations.” 2011. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/20.

MLA Handbook (7th Edition):

Gillman, Adrianna. “Fast Direct Solvers for Elliptic Partial Differential Equations.” 2011. Web. 07 Mar 2021.

Vancouver:

Gillman A. Fast Direct Solvers for Elliptic Partial Differential Equations. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/20.

Council of Science Editors:

Gillman A. Fast Direct Solvers for Elliptic Partial Differential Equations. [Doctoral Dissertation]. University of Colorado; 2011. Available from: https://scholar.colorado.edu/appm_gradetds/20


University of Colorado

3. Halko, Nathan P. Randomized Methods for Computing Low-Rank Approximations of Matrices.

Degree: PhD, Applied Mathematics, 2012, University of Colorado

  Randomized sampling techniques have recently proved capable of efficiently solving many standard problems in linear algebra, and enabling computations at scales far larger than… (more)

Subjects/Keywords: hadoop; mahout; mapreduce; out of core; randomized sampling; singular value decomposition; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Halko, N. P. (2012). Randomized Methods for Computing Low-Rank Approximations of Matrices. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/26

Chicago Manual of Style (16th Edition):

Halko, Nathan P. “Randomized Methods for Computing Low-Rank Approximations of Matrices.” 2012. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/26.

MLA Handbook (7th Edition):

Halko, Nathan P. “Randomized Methods for Computing Low-Rank Approximations of Matrices.” 2012. Web. 07 Mar 2021.

Vancouver:

Halko NP. Randomized Methods for Computing Low-Rank Approximations of Matrices. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/26.

Council of Science Editors:

Halko NP. Randomized Methods for Computing Low-Rank Approximations of Matrices. [Doctoral Dissertation]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/appm_gradetds/26


University of Colorado

4. Folberth, James. Fast and Reliable Methods in Numerical Linear Algebra, Signal Processing, and Image Processing.

Degree: PhD, 2018, University of Colorado

  In this dissertation we consider numerical methods for a problem in each of numerical linear algebra, digital signal processing, and image processing for super-resolution… (more)

Subjects/Keywords: cross-ambiguity function; duality; non-negative least-squares; qr factorization; image processing; Applied Mathematics; Applied Statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Folberth, J. (2018). Fast and Reliable Methods in Numerical Linear Algebra, Signal Processing, and Image Processing. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/134

Chicago Manual of Style (16th Edition):

Folberth, James. “Fast and Reliable Methods in Numerical Linear Algebra, Signal Processing, and Image Processing.” 2018. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/134.

MLA Handbook (7th Edition):

Folberth, James. “Fast and Reliable Methods in Numerical Linear Algebra, Signal Processing, and Image Processing.” 2018. Web. 07 Mar 2021.

Vancouver:

Folberth J. Fast and Reliable Methods in Numerical Linear Algebra, Signal Processing, and Image Processing. [Internet] [Doctoral dissertation]. University of Colorado; 2018. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/134.

Council of Science Editors:

Folberth J. Fast and Reliable Methods in Numerical Linear Algebra, Signal Processing, and Image Processing. [Doctoral Dissertation]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/134


University of Colorado

5. Babb, Tracy. Accelerated Time-Stepping of Parabolic and Hyperbolic Pdes Via Fast Direct Solvers for Elliptic Problems.

Degree: PhD, 2019, University of Colorado

  The dissertation concerns numerical methods for approximately solving certain linear partial differential equations. The foundation is a solution methodology for linear elliptic boundary value… (more)

Subjects/Keywords: Poincare-steklov; linear partial differential equations; multidomain spectral discretization; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Babb, T. (2019). Accelerated Time-Stepping of Parabolic and Hyperbolic Pdes Via Fast Direct Solvers for Elliptic Problems. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/156

Chicago Manual of Style (16th Edition):

Babb, Tracy. “Accelerated Time-Stepping of Parabolic and Hyperbolic Pdes Via Fast Direct Solvers for Elliptic Problems.” 2019. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/156.

MLA Handbook (7th Edition):

Babb, Tracy. “Accelerated Time-Stepping of Parabolic and Hyperbolic Pdes Via Fast Direct Solvers for Elliptic Problems.” 2019. Web. 07 Mar 2021.

Vancouver:

Babb T. Accelerated Time-Stepping of Parabolic and Hyperbolic Pdes Via Fast Direct Solvers for Elliptic Problems. [Internet] [Doctoral dissertation]. University of Colorado; 2019. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/156.

Council of Science Editors:

Babb T. Accelerated Time-Stepping of Parabolic and Hyperbolic Pdes Via Fast Direct Solvers for Elliptic Problems. [Doctoral Dissertation]. University of Colorado; 2019. Available from: https://scholar.colorado.edu/appm_gradetds/156


University of Colorado

6. Biagioni, David Joseph. Numerical construction of Green’s functions in high dimensional elliptic problems with variable coefficients and analysis of renewable energy data via sparse and separable approximations.

Degree: PhD, Applied Mathematics, 2012, University of Colorado

  This thesis consists of two parts. In Part I, we describe an algorithm for approximating the Green's function for elliptic problems with variable coefficients… (more)

Subjects/Keywords: Curse of dimensionality; Direct Poisson solver; High dimensional partial differential equations; Numerical analysis; Randomized canonical tensor decomposition; Separated representations; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Biagioni, D. J. (2012). Numerical construction of Green’s functions in high dimensional elliptic problems with variable coefficients and analysis of renewable energy data via sparse and separable approximations. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/29

Chicago Manual of Style (16th Edition):

Biagioni, David Joseph. “Numerical construction of Green’s functions in high dimensional elliptic problems with variable coefficients and analysis of renewable energy data via sparse and separable approximations.” 2012. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/29.

MLA Handbook (7th Edition):

Biagioni, David Joseph. “Numerical construction of Green’s functions in high dimensional elliptic problems with variable coefficients and analysis of renewable energy data via sparse and separable approximations.” 2012. Web. 07 Mar 2021.

Vancouver:

Biagioni DJ. Numerical construction of Green’s functions in high dimensional elliptic problems with variable coefficients and analysis of renewable energy data via sparse and separable approximations. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/29.

Council of Science Editors:

Biagioni DJ. Numerical construction of Green’s functions in high dimensional elliptic problems with variable coefficients and analysis of renewable energy data via sparse and separable approximations. [Doctoral Dissertation]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/appm_gradetds/29


University of Colorado

7. Reynolds, Matthew Jason. Nonlinear approximations in tomography, quadrature construction, and multivariate reductions.

Degree: PhD, Applied Mathematics, 2012, University of Colorado

  This thesis consists of contributions to three topics: algorithms for computing generalized Gaussian quadratures, tomographic imaging algorithms, and reduction algorithms. Our approach is based… (more)

Subjects/Keywords: Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reynolds, M. J. (2012). Nonlinear approximations in tomography, quadrature construction, and multivariate reductions. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/37

Chicago Manual of Style (16th Edition):

Reynolds, Matthew Jason. “Nonlinear approximations in tomography, quadrature construction, and multivariate reductions.” 2012. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/37.

MLA Handbook (7th Edition):

Reynolds, Matthew Jason. “Nonlinear approximations in tomography, quadrature construction, and multivariate reductions.” 2012. Web. 07 Mar 2021.

Vancouver:

Reynolds MJ. Nonlinear approximations in tomography, quadrature construction, and multivariate reductions. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/37.

Council of Science Editors:

Reynolds MJ. Nonlinear approximations in tomography, quadrature construction, and multivariate reductions. [Doctoral Dissertation]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/appm_gradetds/37


University of Colorado

8. Lewis, Ryan D. Nonlinear Approximations in Filter Design and Wave Propagation.

Degree: PhD, Applied Mathematics, 2013, University of Colorado

  This thesis has two parts. In both parts we use nonlinear approximations to obtain accurate solutions to problems where traditional numerical approaches rapidly become… (more)

Subjects/Keywords: approximation by Gaussians; digital filter design; optimal rational approximation; Rayleigh-Sommerfeld integral; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lewis, R. D. (2013). Nonlinear Approximations in Filter Design and Wave Propagation. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/47

Chicago Manual of Style (16th Edition):

Lewis, Ryan D. “Nonlinear Approximations in Filter Design and Wave Propagation.” 2013. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/47.

MLA Handbook (7th Edition):

Lewis, Ryan D. “Nonlinear Approximations in Filter Design and Wave Propagation.” 2013. Web. 07 Mar 2021.

Vancouver:

Lewis RD. Nonlinear Approximations in Filter Design and Wave Propagation. [Internet] [Doctoral dissertation]. University of Colorado; 2013. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/47.

Council of Science Editors:

Lewis RD. Nonlinear Approximations in Filter Design and Wave Propagation. [Doctoral Dissertation]. University of Colorado; 2013. Available from: https://scholar.colorado.edu/appm_gradetds/47


University of Colorado

9. Martin, Bradley Pifer. Application of Rbf-Fd to Wave and Heat Transport Problems in Domains with Interfaces.

Degree: PhD, Applied Mathematics, 2016, University of Colorado

  Traditional finite difference methods for solving the partial differential equations (PDEs) associated with wave and heat transport often perform poorly when used in domains… (more)

Subjects/Keywords: finite differences; heat equation; interfaces; mesh free; RBF; wave equation; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Martin, B. P. (2016). Application of Rbf-Fd to Wave and Heat Transport Problems in Domains with Interfaces. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/79

Chicago Manual of Style (16th Edition):

Martin, Bradley Pifer. “Application of Rbf-Fd to Wave and Heat Transport Problems in Domains with Interfaces.” 2016. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/79.

MLA Handbook (7th Edition):

Martin, Bradley Pifer. “Application of Rbf-Fd to Wave and Heat Transport Problems in Domains with Interfaces.” 2016. Web. 07 Mar 2021.

Vancouver:

Martin BP. Application of Rbf-Fd to Wave and Heat Transport Problems in Domains with Interfaces. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/79.

Council of Science Editors:

Martin BP. Application of Rbf-Fd to Wave and Heat Transport Problems in Domains with Interfaces. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/appm_gradetds/79


University of Colorado

10. Yang, Xinshuo. Reduction of Multivariate Mixtures and Its Applications.

Degree: PhD, 2018, University of Colorado

  We consider a fast deterministic algorithm to identify the "best" linearly independent terms in multivariate mixtures and use them to compute an equivalent representation… (more)

Subjects/Keywords: far-field summation in high dimensions; hartree-fock equations; integral equations; kernel density estimation; multivariate mixtures; reduction algorithms; Applied Mathematics; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, X. (2018). Reduction of Multivariate Mixtures and Its Applications. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/106

Chicago Manual of Style (16th Edition):

Yang, Xinshuo. “Reduction of Multivariate Mixtures and Its Applications.” 2018. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/106.

MLA Handbook (7th Edition):

Yang, Xinshuo. “Reduction of Multivariate Mixtures and Its Applications.” 2018. Web. 07 Mar 2021.

Vancouver:

Yang X. Reduction of Multivariate Mixtures and Its Applications. [Internet] [Doctoral dissertation]. University of Colorado; 2018. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/106.

Council of Science Editors:

Yang X. Reduction of Multivariate Mixtures and Its Applications. [Doctoral Dissertation]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/106


University of Colorado

11. Appelhans, David John. Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement.

Degree: PhD, Applied Mathematics, 2014, University of Colorado

  In this thesis we propose a new algorithm for solving PDEs on massively parallel computers. The Nested Iteration Adaptive Mesh Refinement Range Decomposition (NI-AMRRD)… (more)

Subjects/Keywords: Adaptive Refinement; FOSLS; High Performance Computing; Nested Iteration; Parallel Algorithms; Range Decomposition; Applied Mathematics; Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Appelhans, D. J. (2014). Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/63

Chicago Manual of Style (16th Edition):

Appelhans, David John. “Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement.” 2014. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/63.

MLA Handbook (7th Edition):

Appelhans, David John. “Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement.” 2014. Web. 07 Mar 2021.

Vancouver:

Appelhans DJ. Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/63.

Council of Science Editors:

Appelhans DJ. Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement. [Doctoral Dissertation]. University of Colorado; 2014. Available from: https://scholar.colorado.edu/appm_gradetds/63


University of Colorado

12. Heavner, Nathan. Building Rank-Revealing Factorizations with Randomization.

Degree: PhD, 2019, University of Colorado

  This thesis describes a set of randomized algorithms for computing rank revealing factorizations of matrices. These algorithms are designed specifically to minimize the amount… (more)

Subjects/Keywords: linear algebra; matrix factorizations; randomization; rank-revealing factorizations; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heavner, N. (2019). Building Rank-Revealing Factorizations with Randomization. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/155

Chicago Manual of Style (16th Edition):

Heavner, Nathan. “Building Rank-Revealing Factorizations with Randomization.” 2019. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/appm_gradetds/155.

MLA Handbook (7th Edition):

Heavner, Nathan. “Building Rank-Revealing Factorizations with Randomization.” 2019. Web. 07 Mar 2021.

Vancouver:

Heavner N. Building Rank-Revealing Factorizations with Randomization. [Internet] [Doctoral dissertation]. University of Colorado; 2019. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/appm_gradetds/155.

Council of Science Editors:

Heavner N. Building Rank-Revealing Factorizations with Randomization. [Doctoral Dissertation]. University of Colorado; 2019. Available from: https://scholar.colorado.edu/appm_gradetds/155


University of Colorado

13. Kaslovsky, Daniel N. Geometric Sparsity in High Dimension.

Degree: PhD, Mathematics, 2012, University of Colorado

  While typically complex and high-dimensional, modern data sets often have a concise underlying structure. This thesis explores the sparsity inherent in the geometric structure… (more)

Subjects/Keywords: Geometry; High-dimensional data; Noise; Sparsity; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kaslovsky, D. N. (2012). Geometric Sparsity in High Dimension. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/15

Chicago Manual of Style (16th Edition):

Kaslovsky, Daniel N. “Geometric Sparsity in High Dimension.” 2012. Doctoral Dissertation, University of Colorado. Accessed March 07, 2021. https://scholar.colorado.edu/math_gradetds/15.

MLA Handbook (7th Edition):

Kaslovsky, Daniel N. “Geometric Sparsity in High Dimension.” 2012. Web. 07 Mar 2021.

Vancouver:

Kaslovsky DN. Geometric Sparsity in High Dimension. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2021 Mar 07]. Available from: https://scholar.colorado.edu/math_gradetds/15.

Council of Science Editors:

Kaslovsky DN. Geometric Sparsity in High Dimension. [Doctoral Dissertation]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/math_gradetds/15

.