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 subject:(Numerical Linear Algebra). Showing records 1 – 30 of 57 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Levels

▼ Search Limiters


University of Oxford

1. Zhu, Shengxin. Numerical linear approximation involving radial basis functions.

Degree: PhD, 2014, University of Oxford

 This thesis aims to acquire, deepen and promote understanding of computing techniques for high dimensional scattered data approximation with radial basis functions. The main contributions… (more)

Subjects/Keywords: 518; Numerical analysis; radial basis functions; numerical linear algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, S. (2014). Numerical linear approximation involving radial basis functions. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:b870646b-5155-45f8-b38c-ae6cf4d22f27 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.644711

Chicago Manual of Style (16th Edition):

Zhu, Shengxin. “Numerical linear approximation involving radial basis functions.” 2014. Doctoral Dissertation, University of Oxford. Accessed July 11, 2020. http://ora.ox.ac.uk/objects/uuid:b870646b-5155-45f8-b38c-ae6cf4d22f27 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.644711.

MLA Handbook (7th Edition):

Zhu, Shengxin. “Numerical linear approximation involving radial basis functions.” 2014. Web. 11 Jul 2020.

Vancouver:

Zhu S. Numerical linear approximation involving radial basis functions. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2020 Jul 11]. Available from: http://ora.ox.ac.uk/objects/uuid:b870646b-5155-45f8-b38c-ae6cf4d22f27 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.644711.

Council of Science Editors:

Zhu S. Numerical linear approximation involving radial basis functions. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:b870646b-5155-45f8-b38c-ae6cf4d22f27 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.644711


University of Kentucky

2. Wilkerson, Owen Tanner. Fast, Sparse Matrix Factorization and Matrix Algebra via Random Sampling for Integral Equation Formulations in Electromagnetics.

Degree: 2019, University of Kentucky

 Many systems designed by electrical & computer engineers rely on electromagnetic (EM) signals to transmit, receive, and extract either information or energy. In many cases,… (more)

Subjects/Keywords: Numerical Simulations; Randomized Numerical Linear Algebra; Computational Electromagnetics; Computational Linear Algebra; Computational Engineering; Electrical and Computer Engineering; Electromagnetics and Photonics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilkerson, O. T. (2019). Fast, Sparse Matrix Factorization and Matrix Algebra via Random Sampling for Integral Equation Formulations in Electromagnetics. (Masters Thesis). University of Kentucky. Retrieved from https://uknowledge.uky.edu/ece_etds/147

Chicago Manual of Style (16th Edition):

Wilkerson, Owen Tanner. “Fast, Sparse Matrix Factorization and Matrix Algebra via Random Sampling for Integral Equation Formulations in Electromagnetics.” 2019. Masters Thesis, University of Kentucky. Accessed July 11, 2020. https://uknowledge.uky.edu/ece_etds/147.

MLA Handbook (7th Edition):

Wilkerson, Owen Tanner. “Fast, Sparse Matrix Factorization and Matrix Algebra via Random Sampling for Integral Equation Formulations in Electromagnetics.” 2019. Web. 11 Jul 2020.

Vancouver:

Wilkerson OT. Fast, Sparse Matrix Factorization and Matrix Algebra via Random Sampling for Integral Equation Formulations in Electromagnetics. [Internet] [Masters thesis]. University of Kentucky; 2019. [cited 2020 Jul 11]. Available from: https://uknowledge.uky.edu/ece_etds/147.

Council of Science Editors:

Wilkerson OT. Fast, Sparse Matrix Factorization and Matrix Algebra via Random Sampling for Integral Equation Formulations in Electromagnetics. [Masters Thesis]. University of Kentucky; 2019. Available from: https://uknowledge.uky.edu/ece_etds/147


UCLA

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

Degree: Computer Science, 2017, UCLA

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yousefi, Arman. “Matrix Balancing in Lp Norms.” 2017. Web. 11 Jul 2020.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Berkeley

4. Arnold, Gilad. Data-Parallel Language for Correct and Efficient Sparse Matrix Codes.

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

 Sparse matrix formats encode very large numerical matrices with relatively few nonzeros. They are typically implemented using imperative languages, with emphasis on low-level optimization. Such… (more)

Subjects/Keywords: Computer science; Compilation; Numerical Linear Algebra; Programming Languages; Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arnold, G. (2011). Data-Parallel Language for Correct and Efficient Sparse Matrix Codes. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/2pw6165p

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Arnold, Gilad. “Data-Parallel Language for Correct and Efficient Sparse Matrix Codes.” 2011. Thesis, University of California – Berkeley. Accessed July 11, 2020. http://www.escholarship.org/uc/item/2pw6165p.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Arnold, Gilad. “Data-Parallel Language for Correct and Efficient Sparse Matrix Codes.” 2011. Web. 11 Jul 2020.

Vancouver:

Arnold G. Data-Parallel Language for Correct and Efficient Sparse Matrix Codes. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Jul 11]. Available from: http://www.escholarship.org/uc/item/2pw6165p.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Arnold G. Data-Parallel Language for Correct and Efficient Sparse Matrix Codes. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/2pw6165p

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Berkeley

5. Solomonik, Edgar. Provably Efficient Algorithms for Numerical Tensor Algebra.

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Solomonik, Edgar. “Provably Efficient Algorithms for Numerical Tensor Algebra.” 2014. Web. 11 Jul 2020.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Temple University

6. Shank, Stephen David. Low-rank solution methods for large-scale linear matrix equations.

Degree: PhD, 2014, Temple University

Mathematics

We consider low-rank solution methods for certain classes of large-scale linear matrix equations. Our aim is to adapt existing low-rank solution methods based on… (more)

Subjects/Keywords: Applied mathematics;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shank, S. D. (2014). Low-rank solution methods for large-scale linear matrix equations. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,273331

Chicago Manual of Style (16th Edition):

Shank, Stephen David. “Low-rank solution methods for large-scale linear matrix equations.” 2014. Doctoral Dissertation, Temple University. Accessed July 11, 2020. http://digital.library.temple.edu/u?/p245801coll10,273331.

MLA Handbook (7th Edition):

Shank, Stephen David. “Low-rank solution methods for large-scale linear matrix equations.” 2014. Web. 11 Jul 2020.

Vancouver:

Shank SD. Low-rank solution methods for large-scale linear matrix equations. [Internet] [Doctoral dissertation]. Temple University; 2014. [cited 2020 Jul 11]. Available from: http://digital.library.temple.edu/u?/p245801coll10,273331.

Council of Science Editors:

Shank SD. Low-rank solution methods for large-scale linear matrix equations. [Doctoral Dissertation]. Temple University; 2014. Available from: http://digital.library.temple.edu/u?/p245801coll10,273331


Vanderbilt University

7. Huang, Longxiu. Dynamical Sampling and its Applications.

Degree: PhD, Mathematics, 2019, Vanderbilt University

 Dynamical sampling is a new area in sampling theory that deals with signals that evolve over time under the action of a linear operator. There… (more)

Subjects/Keywords: Cadzow denoising algorithm; numerical linear algebra; continuous frames; dynamical sampling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, L. (2019). Dynamical Sampling and its Applications. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-03192019-114134/ ;

Chicago Manual of Style (16th Edition):

Huang, Longxiu. “Dynamical Sampling and its Applications.” 2019. Doctoral Dissertation, Vanderbilt University. Accessed July 11, 2020. http://etd.library.vanderbilt.edu/available/etd-03192019-114134/ ;.

MLA Handbook (7th Edition):

Huang, Longxiu. “Dynamical Sampling and its Applications.” 2019. Web. 11 Jul 2020.

Vancouver:

Huang L. Dynamical Sampling and its Applications. [Internet] [Doctoral dissertation]. Vanderbilt University; 2019. [cited 2020 Jul 11]. Available from: http://etd.library.vanderbilt.edu/available/etd-03192019-114134/ ;.

Council of Science Editors:

Huang L. Dynamical Sampling and its Applications. [Doctoral Dissertation]. Vanderbilt University; 2019. Available from: http://etd.library.vanderbilt.edu/available/etd-03192019-114134/ ;


Virginia Tech

8. Kaperick, Bryan James. Diagonal Estimation with Probing Methods.

Degree: MS, Mathematics, 2019, Virginia Tech

 In the past several decades, as computational resources increase, a recurring problem is that of estimating certain properties very large linear systems (matrices containing real… (more)

Subjects/Keywords: Probing Methods; Numerical Linear Algebra; Computational Inverse Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kaperick, B. J. (2019). Diagonal Estimation with Probing Methods. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/90402

Chicago Manual of Style (16th Edition):

Kaperick, Bryan James. “Diagonal Estimation with Probing Methods.” 2019. Masters Thesis, Virginia Tech. Accessed July 11, 2020. http://hdl.handle.net/10919/90402.

MLA Handbook (7th Edition):

Kaperick, Bryan James. “Diagonal Estimation with Probing Methods.” 2019. Web. 11 Jul 2020.

Vancouver:

Kaperick BJ. Diagonal Estimation with Probing Methods. [Internet] [Masters thesis]. Virginia Tech; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10919/90402.

Council of Science Editors:

Kaperick BJ. Diagonal Estimation with Probing Methods. [Masters Thesis]. Virginia Tech; 2019. Available from: http://hdl.handle.net/10919/90402


University of Tennessee – Knoxville

9. Dong, Tingxing. Batched Linear Algebra Problems on GPU Accelerators.

Degree: 2015, University of Tennessee – Knoxville

 The emergence of multicore and heterogeneous architectures requires many linear algebra algorithms to be redesigned to take advantage of the accelerators, such as GPUs. A… (more)

Subjects/Keywords: Linear Algebra; Batched; CUDA; Numerical Analysis and Scientific Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dong, T. (2015). Batched Linear Algebra Problems on GPU Accelerators. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/3573

Chicago Manual of Style (16th Edition):

Dong, Tingxing. “Batched Linear Algebra Problems on GPU Accelerators.” 2015. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed July 11, 2020. https://trace.tennessee.edu/utk_graddiss/3573.

MLA Handbook (7th Edition):

Dong, Tingxing. “Batched Linear Algebra Problems on GPU Accelerators.” 2015. Web. 11 Jul 2020.

Vancouver:

Dong T. Batched Linear Algebra Problems on GPU Accelerators. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2015. [cited 2020 Jul 11]. Available from: https://trace.tennessee.edu/utk_graddiss/3573.

Council of Science Editors:

Dong T. Batched Linear Algebra Problems on GPU Accelerators. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2015. Available from: https://trace.tennessee.edu/utk_graddiss/3573


University of Colorado

10. 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 July 11, 2020. https://scholar.colorado.edu/appm_gradetds/20.

MLA Handbook (7th Edition):

Gillman, Adrianna. “Fast Direct Solvers for Elliptic Partial Differential Equations.” 2011. Web. 11 Jul 2020.

Vancouver:

Gillman A. Fast Direct Solvers for Elliptic Partial Differential Equations. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2020 Jul 11]. 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

11. Nair, Ramya. Customized Sparse Eigenvalue Solutions in Lighthouse.

Degree: MS, Computer Science, 2014, University of Colorado

  We come across sparse eigenvalue problems in many areas of scientific computing. A variety of high-performance numerical software packages with many different eigensolvers are… (more)

Subjects/Keywords: eigenvalue; scientific computing; Lighthouse; linear algebra; Numerical Analysis and Scientific Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nair, R. (2014). Customized Sparse Eigenvalue Solutions in Lighthouse. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/89

Chicago Manual of Style (16th Edition):

Nair, Ramya. “Customized Sparse Eigenvalue Solutions in Lighthouse.” 2014. Masters Thesis, University of Colorado. Accessed July 11, 2020. https://scholar.colorado.edu/csci_gradetds/89.

MLA Handbook (7th Edition):

Nair, Ramya. “Customized Sparse Eigenvalue Solutions in Lighthouse.” 2014. Web. 11 Jul 2020.

Vancouver:

Nair R. Customized Sparse Eigenvalue Solutions in Lighthouse. [Internet] [Masters thesis]. University of Colorado; 2014. [cited 2020 Jul 11]. Available from: https://scholar.colorado.edu/csci_gradetds/89.

Council of Science Editors:

Nair R. Customized Sparse Eigenvalue Solutions in Lighthouse. [Masters Thesis]. University of Colorado; 2014. Available from: https://scholar.colorado.edu/csci_gradetds/89


Delft University of Technology

12. Tabak, F. (author). Robust Algorithms for Discrete Tomography.

Degree: 2012, Delft University of Technology

Tomography methods concentrate on reconstructing objects from multiple projections that are obtained by sending, for example, X-rays through the object. Applications of these methods are,… (more)

Subjects/Keywords: tomography; discrete; DART; numerical linear algebra; noise; reconstruction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tabak, F. (. (2012). Robust Algorithms for Discrete Tomography. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:c6e3b498-4b7e-4fdc-b613-479eba5a1b62

Chicago Manual of Style (16th Edition):

Tabak, F (author). “Robust Algorithms for Discrete Tomography.” 2012. Masters Thesis, Delft University of Technology. Accessed July 11, 2020. http://resolver.tudelft.nl/uuid:c6e3b498-4b7e-4fdc-b613-479eba5a1b62.

MLA Handbook (7th Edition):

Tabak, F (author). “Robust Algorithms for Discrete Tomography.” 2012. Web. 11 Jul 2020.

Vancouver:

Tabak F(. Robust Algorithms for Discrete Tomography. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2020 Jul 11]. Available from: http://resolver.tudelft.nl/uuid:c6e3b498-4b7e-4fdc-b613-479eba5a1b62.

Council of Science Editors:

Tabak F(. Robust Algorithms for Discrete Tomography. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:c6e3b498-4b7e-4fdc-b613-479eba5a1b62


Georgia Tech

13. Xing, Xin. The proxy point method for rank-structured matrices.

Degree: PhD, Mathematics, 2019, Georgia Tech

 Rank-structured matrix representations, e.g., \mathcal{H}2 and HSS, are commonly used to reduce computation and storage cost for dense matrices defined by interactions between many bodies.… (more)

Subjects/Keywords: Rank-structured matrices; Low-rank approximation; Kernel matrices; Numerical linear algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xing, X. (2019). The proxy point method for rank-structured matrices. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62327

Chicago Manual of Style (16th Edition):

Xing, Xin. “The proxy point method for rank-structured matrices.” 2019. Doctoral Dissertation, Georgia Tech. Accessed July 11, 2020. http://hdl.handle.net/1853/62327.

MLA Handbook (7th Edition):

Xing, Xin. “The proxy point method for rank-structured matrices.” 2019. Web. 11 Jul 2020.

Vancouver:

Xing X. The proxy point method for rank-structured matrices. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1853/62327.

Council of Science Editors:

Xing X. The proxy point method for rank-structured matrices. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62327


University of Colorado

14. Border, Richard. Stochastic Lanczos Likelihood Estimation of Genomic Variance Components.

Degree: MS, Applied Mathematics, 2018, University of Colorado

  Genomic variance components analysis seeks to estimate the extent to which interindividual variation in a given trait can be attributed to genetic similarity. Likelihood… (more)

Subjects/Keywords: variance components; likelihood estimation; numerical linear algebra; krylov subspaces; genomics; Biostatistics; Numerical Analysis and Computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Border, R. (2018). Stochastic Lanczos Likelihood Estimation of Genomic Variance Components. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/120

Chicago Manual of Style (16th Edition):

Border, Richard. “Stochastic Lanczos Likelihood Estimation of Genomic Variance Components.” 2018. Masters Thesis, University of Colorado. Accessed July 11, 2020. https://scholar.colorado.edu/appm_gradetds/120.

MLA Handbook (7th Edition):

Border, Richard. “Stochastic Lanczos Likelihood Estimation of Genomic Variance Components.” 2018. Web. 11 Jul 2020.

Vancouver:

Border R. Stochastic Lanczos Likelihood Estimation of Genomic Variance Components. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2020 Jul 11]. Available from: https://scholar.colorado.edu/appm_gradetds/120.

Council of Science Editors:

Border R. Stochastic Lanczos Likelihood Estimation of Genomic Variance Components. [Masters Thesis]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/120


University of Manchester

15. Kannan, Ramaseshan. Numerical linear algebra problems in structural analysis.

Degree: PhD, 2014, University of Manchester

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

Kannan, Ramaseshan. “Numerical linear algebra problems in structural analysis.” 2014. Doctoral Dissertation, University of Manchester. Accessed July 11, 2020. 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 (7th Edition):

Kannan, Ramaseshan. “Numerical linear algebra problems in structural analysis.” 2014. Web. 11 Jul 2020.

Vancouver:

Kannan R. Numerical linear algebra problems in structural analysis. [Internet] [Doctoral dissertation]. University of Manchester; 2014. [cited 2020 Jul 11]. 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


Temple University

16. Ladenheim, Scott Aaron. Constraint Preconditioning of Saddle Point Problems.

Degree: PhD, 2015, Temple University

Mathematics

This thesis is concerned with the fast iterative solution of linear systems of equations of saddle point form. Saddle point problems are a ubiquitous… (more)

Subjects/Keywords: Mathematics;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ladenheim, S. A. (2015). Constraint Preconditioning of Saddle Point Problems. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,319906

Chicago Manual of Style (16th Edition):

Ladenheim, Scott Aaron. “Constraint Preconditioning of Saddle Point Problems.” 2015. Doctoral Dissertation, Temple University. Accessed July 11, 2020. http://digital.library.temple.edu/u?/p245801coll10,319906.

MLA Handbook (7th Edition):

Ladenheim, Scott Aaron. “Constraint Preconditioning of Saddle Point Problems.” 2015. Web. 11 Jul 2020.

Vancouver:

Ladenheim SA. Constraint Preconditioning of Saddle Point Problems. [Internet] [Doctoral dissertation]. Temple University; 2015. [cited 2020 Jul 11]. Available from: http://digital.library.temple.edu/u?/p245801coll10,319906.

Council of Science Editors:

Ladenheim SA. Constraint Preconditioning of Saddle Point Problems. [Doctoral Dissertation]. Temple University; 2015. Available from: http://digital.library.temple.edu/u?/p245801coll10,319906


University of Manchester

17. Song, Zixu. Software engineering abstractions for a numerical linear algebra library.

Degree: PhD, 2012, University of Manchester

 This thesis aims at building a numerical linear algebra library with appropriate software engineering abstractions. Three areas of knowledge, namely, Numerical Linear Algebra (NLA), Software… (more)

Subjects/Keywords: 005.1; numerical linear algebra library; software engineering; compiler optimisation; Band Matrix Operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Song, Z. (2012). Software engineering abstractions for a numerical linear algebra library. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/software-engineering-abstractions-for-a-numerical-linear-algebra-library(68304a9b-56db-404b-8ffb-4613f5102c1a).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558048

Chicago Manual of Style (16th Edition):

Song, Zixu. “Software engineering abstractions for a numerical linear algebra library.” 2012. Doctoral Dissertation, University of Manchester. Accessed July 11, 2020. https://www.research.manchester.ac.uk/portal/en/theses/software-engineering-abstractions-for-a-numerical-linear-algebra-library(68304a9b-56db-404b-8ffb-4613f5102c1a).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558048.

MLA Handbook (7th Edition):

Song, Zixu. “Software engineering abstractions for a numerical linear algebra library.” 2012. Web. 11 Jul 2020.

Vancouver:

Song Z. Software engineering abstractions for a numerical linear algebra library. [Internet] [Doctoral dissertation]. University of Manchester; 2012. [cited 2020 Jul 11]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/software-engineering-abstractions-for-a-numerical-linear-algebra-library(68304a9b-56db-404b-8ffb-4613f5102c1a).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558048.

Council of Science Editors:

Song Z. Software engineering abstractions for a numerical linear algebra library. [Doctoral Dissertation]. University of Manchester; 2012. Available from: https://www.research.manchester.ac.uk/portal/en/theses/software-engineering-abstractions-for-a-numerical-linear-algebra-library(68304a9b-56db-404b-8ffb-4613f5102c1a).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558048


University of Minnesota

18. Ngo, Thanh Trung. Low dimensional approximations: problems and algorithms.

Degree: Computer Science, 2014, University of Minnesota

 High dimensional data usually have intrinsic low rank representations. These low rank representations not only reveal the hidden structure of the data but also reduce… (more)

Subjects/Keywords: Data analysis; Dimension reduction; Low dimensional approximation; Matrix completion; Numerical linear algebra; Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ngo, T. T. (2014). Low dimensional approximations: problems and algorithms. (Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/163875

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ngo, Thanh Trung. “Low dimensional approximations: problems and algorithms.” 2014. Thesis, University of Minnesota. Accessed July 11, 2020. http://hdl.handle.net/11299/163875.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ngo, Thanh Trung. “Low dimensional approximations: problems and algorithms.” 2014. Web. 11 Jul 2020.

Vancouver:

Ngo TT. Low dimensional approximations: problems and algorithms. [Internet] [Thesis]. University of Minnesota; 2014. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11299/163875.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ngo TT. Low dimensional approximations: problems and algorithms. [Thesis]. University of Minnesota; 2014. Available from: http://hdl.handle.net/11299/163875

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Minnesota

19. Ubaru, Shashanka. Algorithmic advances in learning from large dimensional matrices and scientific data.

Degree: PhD, Computer Science, 2018, University of Minnesota

 This thesis is devoted to answering a range of questions in machine learning and data analysis related to large dimensional matrices and scientific data. Two… (more)

Subjects/Keywords: Data Analysis; Error Correcting codes; Machine learning; Matrix approximation; Matrix spectral sums; Numerical linear Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ubaru, S. (2018). Algorithmic advances in learning from large dimensional matrices and scientific data. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/199004

Chicago Manual of Style (16th Edition):

Ubaru, Shashanka. “Algorithmic advances in learning from large dimensional matrices and scientific data.” 2018. Doctoral Dissertation, University of Minnesota. Accessed July 11, 2020. http://hdl.handle.net/11299/199004.

MLA Handbook (7th Edition):

Ubaru, Shashanka. “Algorithmic advances in learning from large dimensional matrices and scientific data.” 2018. Web. 11 Jul 2020.

Vancouver:

Ubaru S. Algorithmic advances in learning from large dimensional matrices and scientific data. [Internet] [Doctoral dissertation]. University of Minnesota; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11299/199004.

Council of Science Editors:

Ubaru S. Algorithmic advances in learning from large dimensional matrices and scientific data. [Doctoral Dissertation]. University of Minnesota; 2018. Available from: http://hdl.handle.net/11299/199004


University of British Columbia

20. Sarkar, Basanta. Numerical and algebraic methods for computer-aided design of linear and piece-wise linear systems .

Degree: 1967, University of British Columbia

 A method is presented for linear control system design using functional relations between system parameters and system response. The functional relations are obtained by frequency… (more)

Subjects/Keywords: Numerical calculations; Algebra, Linear; System amalysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sarkar, B. (1967). Numerical and algebraic methods for computer-aided design of linear and piece-wise linear systems . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/37265

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sarkar, Basanta. “Numerical and algebraic methods for computer-aided design of linear and piece-wise linear systems .” 1967. Thesis, University of British Columbia. Accessed July 11, 2020. http://hdl.handle.net/2429/37265.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sarkar, Basanta. “Numerical and algebraic methods for computer-aided design of linear and piece-wise linear systems .” 1967. Web. 11 Jul 2020.

Vancouver:

Sarkar B. Numerical and algebraic methods for computer-aided design of linear and piece-wise linear systems . [Internet] [Thesis]. University of British Columbia; 1967. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2429/37265.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sarkar B. Numerical and algebraic methods for computer-aided design of linear and piece-wise linear systems . [Thesis]. University of British Columbia; 1967. Available from: http://hdl.handle.net/2429/37265

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

21. Nelis, H.W. Sparse approximations of inverse matrices.

Degree: 1989, Delft University of Technology

Subjects/Keywords: Matrix theory; Numerical mathematics; Numerical linear algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelis, H. W. (1989). Sparse approximations of inverse matrices. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; urn:NBN:nl:ui:24-uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; urn:NBN:nl:ui:24-uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; http://resolver.tudelft.nl/uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a

Chicago Manual of Style (16th Edition):

Nelis, H W. “Sparse approximations of inverse matrices.” 1989. Doctoral Dissertation, Delft University of Technology. Accessed July 11, 2020. http://resolver.tudelft.nl/uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; urn:NBN:nl:ui:24-uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; urn:NBN:nl:ui:24-uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; http://resolver.tudelft.nl/uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a.

MLA Handbook (7th Edition):

Nelis, H W. “Sparse approximations of inverse matrices.” 1989. Web. 11 Jul 2020.

Vancouver:

Nelis HW. Sparse approximations of inverse matrices. [Internet] [Doctoral dissertation]. Delft University of Technology; 1989. [cited 2020 Jul 11]. Available from: http://resolver.tudelft.nl/uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; urn:NBN:nl:ui:24-uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; urn:NBN:nl:ui:24-uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; http://resolver.tudelft.nl/uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a.

Council of Science Editors:

Nelis HW. Sparse approximations of inverse matrices. [Doctoral Dissertation]. Delft University of Technology; 1989. Available from: http://resolver.tudelft.nl/uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; urn:NBN:nl:ui:24-uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; urn:NBN:nl:ui:24-uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a ; http://resolver.tudelft.nl/uuid:4ba3864a-40c2-4d36-8dc1-2277dcb28b3a


University of Manchester

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

Degree: 2018, University of Manchester

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Zhang, Weijian. “Evolving Graphs and Similarity-based Graphs with Applications.” 2018. Web. 11 Jul 2020.

Vancouver:

Zhang W. Evolving Graphs and Similarity-based Graphs with Applications. [Internet] [Doctoral dissertation]. University of Manchester; 2018. [cited 2020 Jul 11]. 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


Indian Institute of Science

23. Biswas, Prasenjit. Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture.

Degree: 2011, Indian Institute of Science

 Application domains such as Bio-informatics, DSP, Structural Biology, Fluid Dynamics, high resolution direction finding, state estimation, adaptive noise cancellation etc. demand high performance computing solutions… (more)

Subjects/Keywords: Computer Architecture; Systolic Algorithms; REDEFINE; Numerical Linear Algebra Kernels; NLA Kernels; Custom Functional Units (CFU); Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Biswas, P. (2011). Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2108

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Biswas, Prasenjit. “Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture.” 2011. Thesis, Indian Institute of Science. Accessed July 11, 2020. http://hdl.handle.net/2005/2108.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Biswas, Prasenjit. “Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture.” 2011. Web. 11 Jul 2020.

Vancouver:

Biswas P. Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture. [Internet] [Thesis]. Indian Institute of Science; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2005/2108.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Biswas P. Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture. [Thesis]. Indian Institute of Science; 2011. Available from: http://hdl.handle.net/2005/2108

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Berkeley

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hoemmen, Mark. “Communication-avoiding Krylov subspace methods.” 2010. Web. 11 Jul 2020.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universiteit Utrecht

25. Leeuw, B.M. de. On the numerical computation of electron transport through a topological crystalline insulator.

Degree: 2015, Universiteit Utrecht

 In this thesis we aim to compute the conductance of a disordered nonstandard topological insulator numerically. We test several algorithms for this purpose and argue… (more)

Subjects/Keywords: Quantum Mechanics; Electron transport; Green's functions; Numerical linear algebra; Recursive Green's functions algorithm; Disorder; Crystals; Topological insulators; Symmetries; Topological crystalline insulators

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leeuw, B. M. d. (2015). On the numerical computation of electron transport through a topological crystalline insulator. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/310665

Chicago Manual of Style (16th Edition):

Leeuw, B M de. “On the numerical computation of electron transport through a topological crystalline insulator.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 11, 2020. http://dspace.library.uu.nl:8080/handle/1874/310665.

MLA Handbook (7th Edition):

Leeuw, B M de. “On the numerical computation of electron transport through a topological crystalline insulator.” 2015. Web. 11 Jul 2020.

Vancouver:

Leeuw BMd. On the numerical computation of electron transport through a topological crystalline insulator. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Jul 11]. Available from: http://dspace.library.uu.nl:8080/handle/1874/310665.

Council of Science Editors:

Leeuw BMd. On the numerical computation of electron transport through a topological crystalline insulator. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/310665


Kyoto University / 京都大学

26. Ishigami, Hiroyuki. Studies on Parallel Solvers Based on Bisection and Inverse Iterationfor Subsets of Eigenpairs and Singular Triplets : 2分法と逆反復法を基礎とした部分固有対および部分特異対のための並列ソルバについての研究.

Degree: 博士(情報学), 2016, Kyoto University / 京都大学

5章(本文31~40ページ)と元となった論文の著作権はIEEEに属するため、規約に従い、本文79ページにおいて出典を示すともに、コピーライト表記を付している。本文39、40ページの全ての図の著作権は、IEEEに属する。このため、これら全ての図においてコピーライト表記を付している。

新制・課程博士

甲第19858号

情博第609号

Subjects/Keywords: numerical linear algebra; parallel processing; bisection and inverse iteration algorithm; eigenpair subset compuation; singular triplet subset computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ishigami, H. (2016). Studies on Parallel Solvers Based on Bisection and Inverse Iterationfor Subsets of Eigenpairs and Singular Triplets : 2分法と逆反復法を基礎とした部分固有対および部分特異対のための並列ソルバについての研究. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/215685 ; http://dx.doi.org/10.14989/doctor.k19858

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ishigami, Hiroyuki. “Studies on Parallel Solvers Based on Bisection and Inverse Iterationfor Subsets of Eigenpairs and Singular Triplets : 2分法と逆反復法を基礎とした部分固有対および部分特異対のための並列ソルバについての研究.” 2016. Thesis, Kyoto University / 京都大学. Accessed July 11, 2020. http://hdl.handle.net/2433/215685 ; http://dx.doi.org/10.14989/doctor.k19858.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ishigami, Hiroyuki. “Studies on Parallel Solvers Based on Bisection and Inverse Iterationfor Subsets of Eigenpairs and Singular Triplets : 2分法と逆反復法を基礎とした部分固有対および部分特異対のための並列ソルバについての研究.” 2016. Web. 11 Jul 2020.

Vancouver:

Ishigami H. Studies on Parallel Solvers Based on Bisection and Inverse Iterationfor Subsets of Eigenpairs and Singular Triplets : 2分法と逆反復法を基礎とした部分固有対および部分特異対のための並列ソルバについての研究. [Internet] [Thesis]. Kyoto University / 京都大学; 2016. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2433/215685 ; http://dx.doi.org/10.14989/doctor.k19858.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ishigami H. Studies on Parallel Solvers Based on Bisection and Inverse Iterationfor Subsets of Eigenpairs and Singular Triplets : 2分法と逆反復法を基礎とした部分固有対および部分特異対のための並列ソルバについての研究. [Thesis]. Kyoto University / 京都大学; 2016. Available from: http://hdl.handle.net/2433/215685 ; http://dx.doi.org/10.14989/doctor.k19858

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

27. Biswas, Prasenjit. Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture.

Degree: 2011, Indian Institute of Science

 Application domains such as Bio-informatics, DSP, Structural Biology, Fluid Dynamics, high resolution direction finding, state estimation, adaptive noise cancellation etc. demand high performance computing solutions… (more)

Subjects/Keywords: Computer Architecture; Systolic Algorithms; REDEFINE; Numerical Linear Algebra Kernels; NLA Kernels; Custom Functional Units (CFU); Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Biswas, P. (2011). Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2108 ; http://etd.ncsi.iisc.ernet.in/abstracts/2705/G24895-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Biswas, Prasenjit. “Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture.” 2011. Thesis, Indian Institute of Science. Accessed July 11, 2020. http://etd.iisc.ernet.in/handle/2005/2108 ; http://etd.ncsi.iisc.ernet.in/abstracts/2705/G24895-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Biswas, Prasenjit. “Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture.” 2011. Web. 11 Jul 2020.

Vancouver:

Biswas P. Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture. [Internet] [Thesis]. Indian Institute of Science; 2011. [cited 2020 Jul 11]. Available from: http://etd.iisc.ernet.in/handle/2005/2108 ; http://etd.ncsi.iisc.ernet.in/abstracts/2705/G24895-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Biswas P. Hardware Consolidation Of Systolic Algorithms On A Coarse Grained Runtime Reconfigurable Architecture. [Thesis]. Indian Institute of Science; 2011. Available from: http://etd.iisc.ernet.in/handle/2005/2108 ; http://etd.ncsi.iisc.ernet.in/abstracts/2705/G24895-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

28. Chen, Cheng-yu. Calculating Distribution Function and Characteristic Function using Mathematica.

Degree: Master, Applied Mathematics, 2010, NSYSU

 This paper deals with the applications of symbolic computation of Mathematica 7.0 (Wolfram, 2008) in distribution theory. The purpose of this study is twofold. Firstly,… (more)

Subjects/Keywords: characteristic function; computer algebra system; independent univariate random variables; Mathematica; numerical computation; symbolic computation; linear combination

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, C. (2010). Calculating Distribution Function and Characteristic Function using Mathematica. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0707110-152658

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Cheng-yu. “Calculating Distribution Function and Characteristic Function using Mathematica.” 2010. Thesis, NSYSU. Accessed July 11, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0707110-152658.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Cheng-yu. “Calculating Distribution Function and Characteristic Function using Mathematica.” 2010. Web. 11 Jul 2020.

Vancouver:

Chen C. Calculating Distribution Function and Characteristic Function using Mathematica. [Internet] [Thesis]. NSYSU; 2010. [cited 2020 Jul 11]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0707110-152658.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen C. Calculating Distribution Function and Characteristic Function using Mathematica. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0707110-152658

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universiteit Utrecht

29. Leeuw, B.M. de. On the numerical computation of electron transport through a topological crystalline insulator.

Degree: 2015, Universiteit Utrecht

 In this thesis we aim to compute the conductance of a disordered nonstandard topological insulator numerically. We test several algorithms for this purpose and argue… (more)

Subjects/Keywords: Quantum Mechanics; Electron transport; Green's functions; Numerical linear algebra; Recursive Green's functions algorithm; Disorder; Crystals; Topological insulators; Symmetries; Topological crystalline insulators

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leeuw, B. M. d. (2015). On the numerical computation of electron transport through a topological crystalline insulator. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/310790

Chicago Manual of Style (16th Edition):

Leeuw, B M de. “On the numerical computation of electron transport through a topological crystalline insulator.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 11, 2020. http://dspace.library.uu.nl:8080/handle/1874/310790.

MLA Handbook (7th Edition):

Leeuw, B M de. “On the numerical computation of electron transport through a topological crystalline insulator.” 2015. Web. 11 Jul 2020.

Vancouver:

Leeuw BMd. On the numerical computation of electron transport through a topological crystalline insulator. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Jul 11]. Available from: http://dspace.library.uu.nl:8080/handle/1874/310790.

Council of Science Editors:

Leeuw BMd. On the numerical computation of electron transport through a topological crystalline insulator. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/310790

30. Nip, Michael David Yuan-jun. Computational Tools for Large-Scale Linear Systems.

Degree: 2014, University of California – eScholarship, University of California

 While the theoretical analysis of linear dynamical systems with finite state-spaces is a mature topic, in situations where the underlying model has a large number… (more)

Subjects/Keywords: Mechanical engineering; Biophysics; Applied mathematics; Algorithms; Control Theory; Modeling; Numerical Linear Algebra; Stochastic Processes; Systems Biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nip, M. D. Y. (2014). Computational Tools for Large-Scale Linear Systems. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/7241p5d6

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nip, Michael David Yuan-jun. “Computational Tools for Large-Scale Linear Systems.” 2014. Thesis, University of California – eScholarship, University of California. Accessed July 11, 2020. http://www.escholarship.org/uc/item/7241p5d6.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nip, Michael David Yuan-jun. “Computational Tools for Large-Scale Linear Systems.” 2014. Web. 11 Jul 2020.

Vancouver:

Nip MDY. Computational Tools for Large-Scale Linear Systems. [Internet] [Thesis]. University of California – eScholarship, University of California; 2014. [cited 2020 Jul 11]. Available from: http://www.escholarship.org/uc/item/7241p5d6.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nip MDY. Computational Tools for Large-Scale Linear Systems. [Thesis]. University of California – eScholarship, University of California; 2014. Available from: http://www.escholarship.org/uc/item/7241p5d6

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2]

.