Advanced search options

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

You searched for `subject:(Decomposition methods)`

.
Showing records 1 – 30 of
117 total matches.

Search Limiters

Dates

- 2015 – 2019 (45)
- 2010 – 2014 (48)
- 2005 – 2009 (22)

Degrees

- PhD (25)
- Docteur es (22)

▼ Search Limiters

University of Texas – Austin

1.
-3203-266X.
Numerical algorithms based on Galerkin *methods* for the modeling of reactive interfaces in photoelectrochemical solar cells.

Degree: PhD, Computational Science, Engineering, and Mathematics, 2016, University of Texas – Austin

URL: http://hdl.handle.net/2152/46973

► Large-scale utilization of photovoltaic (PV) devices, or solar cells, has been hampered for years due to high costs and lack of energy storage mechanisms. Photoelectrochemical…
(more)

Subjects/Keywords: Discontinuous Galerkin methods; Mixed methods; Domain decomposition methods; Solar cells

Record Details Similar Records

❌

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

APA (6^{th} Edition):

-3203-266X. (2016). Numerical algorithms based on Galerkin methods for the modeling of reactive interfaces in photoelectrochemical solar cells. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/46973

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

Author name may be incomplete

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

-3203-266X. “Numerical algorithms based on Galerkin methods for the modeling of reactive interfaces in photoelectrochemical solar cells.” 2016. Doctoral Dissertation, University of Texas – Austin. Accessed December 09, 2019. http://hdl.handle.net/2152/46973.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

-3203-266X. “Numerical algorithms based on Galerkin methods for the modeling of reactive interfaces in photoelectrochemical solar cells.” 2016. Web. 09 Dec 2019.

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

Author name may be incomplete

Vancouver:

-3203-266X. Numerical algorithms based on Galerkin methods for the modeling of reactive interfaces in photoelectrochemical solar cells. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2016. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/2152/46973.

Author name may be incomplete

Council of Science Editors:

-3203-266X. Numerical algorithms based on Galerkin methods for the modeling of reactive interfaces in photoelectrochemical solar cells. [Doctoral Dissertation]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/46973

Author name may be incomplete

University of Minnesota

2.
Fu, Guosheng.
Devising superconvergent HDG *methods* by M-decompositions.

Degree: PhD, Mathematics, 2016, University of Minnesota

URL: http://hdl.handle.net/11299/182270

► In this thesis, we develop the concept of an M-*decomposition* as an effective tool for devising high-order accurate hybridizable discontinuous Galerkin *methods* and hybridized mixed…
(more)

Subjects/Keywords: discontinuous Galerkin; hybridization; M-decomposition; mixed methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fu, G. (2016). Devising superconvergent HDG methods by M-decompositions. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/182270

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

Fu, Guosheng. “Devising superconvergent HDG methods by M-decompositions.” 2016. Doctoral Dissertation, University of Minnesota. Accessed December 09, 2019. http://hdl.handle.net/11299/182270.

MLA Handbook (7^{th} Edition):

Fu, Guosheng. “Devising superconvergent HDG methods by M-decompositions.” 2016. Web. 09 Dec 2019.

Vancouver:

Fu G. Devising superconvergent HDG methods by M-decompositions. [Internet] [Doctoral dissertation]. University of Minnesota; 2016. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/11299/182270.

Council of Science Editors:

Fu G. Devising superconvergent HDG methods by M-decompositions. [Doctoral Dissertation]. University of Minnesota; 2016. Available from: http://hdl.handle.net/11299/182270

UCLA

3.
Dragomiretskiy, Konstantin.
Variational *Methods* in Signal *Decomposition* and Image Processing.

Degree: Mathematics, 2015, UCLA

URL: http://www.escholarship.org/uc/item/4zx6s9zs

► The work presented in this dissertation is motivated by classical problems in signal and image processing from the perspective of variational and PDE-based *methods*. Analytically…
(more)

Subjects/Keywords: Applied mathematics; Image Processing; Image Segmentation; Mode Decomposition; Signal Decomposition; Signal Processing; Variational Methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dragomiretskiy, K. (2015). Variational Methods in Signal Decomposition and Image Processing. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/4zx6s9zs

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

Dragomiretskiy, Konstantin. “Variational Methods in Signal Decomposition and Image Processing.” 2015. Thesis, UCLA. Accessed December 09, 2019. http://www.escholarship.org/uc/item/4zx6s9zs.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dragomiretskiy, Konstantin. “Variational Methods in Signal Decomposition and Image Processing.” 2015. Web. 09 Dec 2019.

Vancouver:

Dragomiretskiy K. Variational Methods in Signal Decomposition and Image Processing. [Internet] [Thesis]. UCLA; 2015. [cited 2019 Dec 09]. Available from: http://www.escholarship.org/uc/item/4zx6s9zs.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dragomiretskiy K. Variational Methods in Signal Decomposition and Image Processing. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/4zx6s9zs

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

4.
Richardson, Brian Ross.
A reduced-order model based on proper orthogonal *decomposition* for non-isothermal two-phase flows.

Degree: 2009, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2623

► This thesis presents a study of reduced-order models based on proper orthogonal *decomposition* applied to non-isothermal transport phenomena in ?uidized beds. A numerical ?ow solver…
(more)

Subjects/Keywords: Proper Orthogonal Decomposition; Reduced-Order Model; Numerical Methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Richardson, B. R. (2009). A reduced-order model based on proper orthogonal decomposition for non-isothermal two-phase flows. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2623

Not specified: Masters Thesis or Doctoral Dissertation

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

Richardson, Brian Ross. “A reduced-order model based on proper orthogonal decomposition for non-isothermal two-phase flows.” 2009. Thesis, Texas A&M University. Accessed December 09, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2623.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Richardson, Brian Ross. “A reduced-order model based on proper orthogonal decomposition for non-isothermal two-phase flows.” 2009. Web. 09 Dec 2019.

Vancouver:

Richardson BR. A reduced-order model based on proper orthogonal decomposition for non-isothermal two-phase flows. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2623.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Richardson BR. A reduced-order model based on proper orthogonal decomposition for non-isothermal two-phase flows. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2623

Not specified: Masters Thesis or Doctoral Dissertation

Brunel University

5.
Zverovich, Victor.
Modelling and solution *methods* for stochastic optimisation.

Degree: PhD, 2011, Brunel University

URL: http://bura.brunel.ac.uk/handle/2438/5922 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539922

► In this thesis we consider two research problems, namely, (i) language constructs for modelling stochastic programming (SP) problems and (ii) solution *methods* for processing instances…
(more)

Subjects/Keywords: 005.3; Stochastic programming; Decomposition methods; Modelling and solver system

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zverovich, V. (2011). Modelling and solution methods for stochastic optimisation. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/5922 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539922

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

Zverovich, Victor. “Modelling and solution methods for stochastic optimisation.” 2011. Doctoral Dissertation, Brunel University. Accessed December 09, 2019. http://bura.brunel.ac.uk/handle/2438/5922 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539922.

MLA Handbook (7^{th} Edition):

Zverovich, Victor. “Modelling and solution methods for stochastic optimisation.” 2011. Web. 09 Dec 2019.

Vancouver:

Zverovich V. Modelling and solution methods for stochastic optimisation. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2019 Dec 09]. Available from: http://bura.brunel.ac.uk/handle/2438/5922 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539922.

Council of Science Editors:

Zverovich V. Modelling and solution methods for stochastic optimisation. [Doctoral Dissertation]. Brunel University; 2011. Available from: http://bura.brunel.ac.uk/handle/2438/5922 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539922

Cornell University

6.
Chan, Collin.
*Decomposition**Methods* For Managing Service Parts With Coupled Demands
.

Degree: 2012, Cornell University

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

► We consider the inventory management problem of procurement and allocation for a non-stationary equipment overhaul problem with stochastic demands for multiple job types requiring different…
(more)

Subjects/Keywords: Service Parts Supply Chains; Decomposition Methods; Approximate Dynamic Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chan, C. (2012). Decomposition Methods For Managing Service Parts With Coupled Demands . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/31002

Not specified: Masters Thesis or Doctoral Dissertation

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

Chan, Collin. “Decomposition Methods For Managing Service Parts With Coupled Demands .” 2012. Thesis, Cornell University. Accessed December 09, 2019. http://hdl.handle.net/1813/31002.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chan, Collin. “Decomposition Methods For Managing Service Parts With Coupled Demands .” 2012. Web. 09 Dec 2019.

Vancouver:

Chan C. Decomposition Methods For Managing Service Parts With Coupled Demands . [Internet] [Thesis]. Cornell University; 2012. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1813/31002.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chan C. Decomposition Methods For Managing Service Parts With Coupled Demands . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31002

Not specified: Masters Thesis or Doctoral Dissertation

UCLA

7.
Sun, Yifan.
*Decomposition**methods* for semidefinite optimization.

Degree: Electrical Engineering, 2015, UCLA

URL: http://www.escholarship.org/uc/item/1cv6981p

► Semidefinite optimization problems (SDPs) arise in many applications, including combinatorial optimization, control and signal processing, structural optimization, statistics, and machine learning. Currently, most SDPs are…
(more)

Subjects/Keywords: Electrical engineering; decomposition; first-order methods; large-scale optimization; semidefinite optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sun, Y. (2015). Decomposition methods for semidefinite optimization. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/1cv6981p

Not specified: Masters Thesis or Doctoral Dissertation

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

Sun, Yifan. “Decomposition methods for semidefinite optimization.” 2015. Thesis, UCLA. Accessed December 09, 2019. http://www.escholarship.org/uc/item/1cv6981p.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sun, Yifan. “Decomposition methods for semidefinite optimization.” 2015. Web. 09 Dec 2019.

Vancouver:

Sun Y. Decomposition methods for semidefinite optimization. [Internet] [Thesis]. UCLA; 2015. [cited 2019 Dec 09]. Available from: http://www.escholarship.org/uc/item/1cv6981p.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sun Y. Decomposition methods for semidefinite optimization. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/1cv6981p

Not specified: Masters Thesis or Doctoral Dissertation

University of New Mexico

8.
Quintana, Ambrose.
Preconditioners constructed from the interpolative *decomposition* for the variable coefficient Poisson problem.

Degree: Mathematics & Statistics, 2013, University of New Mexico

URL: http://hdl.handle.net/1928/23291

► When trying to solve elliptical problems such as the Poisson problem on complicated domains, one procedure is to split the domain into a union of…
(more)

Subjects/Keywords: Linear systems – Mathematical models; Decomposition (Mathematics); Iterative methods (Mathematics); Random matrices.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Quintana, A. (2013). Preconditioners constructed from the interpolative decomposition for the variable coefficient Poisson problem. (Masters Thesis). University of New Mexico. Retrieved from http://hdl.handle.net/1928/23291

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

Quintana, Ambrose. “Preconditioners constructed from the interpolative decomposition for the variable coefficient Poisson problem.” 2013. Masters Thesis, University of New Mexico. Accessed December 09, 2019. http://hdl.handle.net/1928/23291.

MLA Handbook (7^{th} Edition):

Quintana, Ambrose. “Preconditioners constructed from the interpolative decomposition for the variable coefficient Poisson problem.” 2013. Web. 09 Dec 2019.

Vancouver:

Quintana A. Preconditioners constructed from the interpolative decomposition for the variable coefficient Poisson problem. [Internet] [Masters thesis]. University of New Mexico; 2013. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1928/23291.

Council of Science Editors:

Quintana A. Preconditioners constructed from the interpolative decomposition for the variable coefficient Poisson problem. [Masters Thesis]. University of New Mexico; 2013. Available from: http://hdl.handle.net/1928/23291

Brigham Young University

9. Gardner, Matthew J. A Speculative Approach to Parallelization in Particle Swarm Optimization.

Degree: MS, 2011, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd

► Particle swarm optimization (PSO) has previously been parallelized primarily by distributing the computation corresponding to particles across multiple processors. In this thesis we present a…
(more)

Subjects/Keywords: parallel algorithms; optimization methods; particle swarm optimization; speculative decomposition; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gardner, M. J. (2011). A Speculative Approach to Parallelization in Particle Swarm Optimization. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd

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

Gardner, Matthew J. “A Speculative Approach to Parallelization in Particle Swarm Optimization.” 2011. Masters Thesis, Brigham Young University. Accessed December 09, 2019. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd.

MLA Handbook (7^{th} Edition):

Gardner, Matthew J. “A Speculative Approach to Parallelization in Particle Swarm Optimization.” 2011. Web. 09 Dec 2019.

Vancouver:

Gardner MJ. A Speculative Approach to Parallelization in Particle Swarm Optimization. [Internet] [Masters thesis]. Brigham Young University; 2011. [cited 2019 Dec 09]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd.

Council of Science Editors:

Gardner MJ. A Speculative Approach to Parallelization in Particle Swarm Optimization. [Masters Thesis]. Brigham Young University; 2011. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd

University of Windsor

10.
Ravichandran, Ramya.
Cultural Algorithm based on *Decomposition* to solve Optimization Problems.

Degree: MS, Computer Science, 2019, University of Windsor

URL: https://scholar.uwindsor.ca/etd/7835

► *Decomposition* is used to solve optimization problems by introducing many simple scalar optimization subproblems and optimizing them simultaneously. Dynamic Multi-Objective Optimization Problems (DMOP) have several…
(more)

Subjects/Keywords: Cultural Algorithms; Decomposition Methods; Evolutionary Computation; Optimization Problems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ravichandran, R. (2019). Cultural Algorithm based on Decomposition to solve Optimization Problems. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/7835

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

Ravichandran, Ramya. “Cultural Algorithm based on Decomposition to solve Optimization Problems.” 2019. Masters Thesis, University of Windsor. Accessed December 09, 2019. https://scholar.uwindsor.ca/etd/7835.

MLA Handbook (7^{th} Edition):

Ravichandran, Ramya. “Cultural Algorithm based on Decomposition to solve Optimization Problems.” 2019. Web. 09 Dec 2019.

Vancouver:

Ravichandran R. Cultural Algorithm based on Decomposition to solve Optimization Problems. [Internet] [Masters thesis]. University of Windsor; 2019. [cited 2019 Dec 09]. Available from: https://scholar.uwindsor.ca/etd/7835.

Council of Science Editors:

Ravichandran R. Cultural Algorithm based on Decomposition to solve Optimization Problems. [Masters Thesis]. University of Windsor; 2019. Available from: https://scholar.uwindsor.ca/etd/7835

11.
Munoz, Francisco David.
Engineering-Economic *Methods* for Power Transmission Planning Under Uncertainty and Renewable Resource Policies.

Degree: 2014, Johns Hopkins University

URL: http://jhir.library.jhu.edu/handle/1774.2/37067

► Power transmission networks are some of the world's largest machines. Investments in these assets have historically been driven by projections of load growth, interconnection of…
(more)

Subjects/Keywords: Transmission Planning; Uncertainty; Renewable Portfolio Standards; Benders Decomposition; Bounding Methods; Parallel Computing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Munoz, F. D. (2014). Engineering-Economic Methods for Power Transmission Planning Under Uncertainty and Renewable Resource Policies. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/37067

Not specified: Masters Thesis or Doctoral Dissertation

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

Munoz, Francisco David. “Engineering-Economic Methods for Power Transmission Planning Under Uncertainty and Renewable Resource Policies.” 2014. Thesis, Johns Hopkins University. Accessed December 09, 2019. http://jhir.library.jhu.edu/handle/1774.2/37067.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Munoz, Francisco David. “Engineering-Economic Methods for Power Transmission Planning Under Uncertainty and Renewable Resource Policies.” 2014. Web. 09 Dec 2019.

Vancouver:

Munoz FD. Engineering-Economic Methods for Power Transmission Planning Under Uncertainty and Renewable Resource Policies. [Internet] [Thesis]. Johns Hopkins University; 2014. [cited 2019 Dec 09]. Available from: http://jhir.library.jhu.edu/handle/1774.2/37067.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Munoz FD. Engineering-Economic Methods for Power Transmission Planning Under Uncertainty and Renewable Resource Policies. [Thesis]. Johns Hopkins University; 2014. Available from: http://jhir.library.jhu.edu/handle/1774.2/37067

Not specified: Masters Thesis or Doctoral Dissertation

Carnegie Mellon University

12. Xiong, Liang. On Learning from Collective Data.

Degree: 2013, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/560

► In many machine learning problems and application domains, the data are naturally organized by groups. For example, a video sequence is a group of images,…
(more)

Subjects/Keywords: Collective data; grouped data; point sets; low-rank decomposition; robust methods; anomaly detection

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xiong, L. (2013). On Learning from Collective Data. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/560

Not specified: Masters Thesis or Doctoral Dissertation

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

Xiong, Liang. “On Learning from Collective Data.” 2013. Thesis, Carnegie Mellon University. Accessed December 09, 2019. http://repository.cmu.edu/dissertations/560.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Xiong, Liang. “On Learning from Collective Data.” 2013. Web. 09 Dec 2019.

Vancouver:

Xiong L. On Learning from Collective Data. [Internet] [Thesis]. Carnegie Mellon University; 2013. [cited 2019 Dec 09]. Available from: http://repository.cmu.edu/dissertations/560.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xiong L. On Learning from Collective Data. [Thesis]. Carnegie Mellon University; 2013. Available from: http://repository.cmu.edu/dissertations/560

Not specified: Masters Thesis or Doctoral Dissertation

Louisiana State University

13.
Nan, Zhe.
Application of Helmholtz/Hodge *Decomposition* to Finite Element *Methods* for Two-Dimensional Maxwell's Equations.

Degree: PhD, Applied Mathematics, 2013, Louisiana State University

URL: etd-04142013-195038 ; https://digitalcommons.lsu.edu/gradschool_dissertations/147

► In this work we apply the two-dimensional Helmholtz/Hodge *decomposition* to develop new finite element schemes for two-dimensional Maxwell's equations. We begin with the introduction of…
(more)

Subjects/Keywords: multigrid algorithms; Helmholtz/Hodge decomposition; Maxwell's equations; interface problems; extraction formulas; finite element methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nan, Z. (2013). Application of Helmholtz/Hodge Decomposition to Finite Element Methods for Two-Dimensional Maxwell's Equations. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-04142013-195038 ; https://digitalcommons.lsu.edu/gradschool_dissertations/147

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

Nan, Zhe. “Application of Helmholtz/Hodge Decomposition to Finite Element Methods for Two-Dimensional Maxwell's Equations.” 2013. Doctoral Dissertation, Louisiana State University. Accessed December 09, 2019. etd-04142013-195038 ; https://digitalcommons.lsu.edu/gradschool_dissertations/147.

MLA Handbook (7^{th} Edition):

Nan, Zhe. “Application of Helmholtz/Hodge Decomposition to Finite Element Methods for Two-Dimensional Maxwell's Equations.” 2013. Web. 09 Dec 2019.

Vancouver:

Nan Z. Application of Helmholtz/Hodge Decomposition to Finite Element Methods for Two-Dimensional Maxwell's Equations. [Internet] [Doctoral dissertation]. Louisiana State University; 2013. [cited 2019 Dec 09]. Available from: etd-04142013-195038 ; https://digitalcommons.lsu.edu/gradschool_dissertations/147.

Council of Science Editors:

Nan Z. Application of Helmholtz/Hodge Decomposition to Finite Element Methods for Two-Dimensional Maxwell's Equations. [Doctoral Dissertation]. Louisiana State University; 2013. Available from: etd-04142013-195038 ; https://digitalcommons.lsu.edu/gradschool_dissertations/147

University of California – Irvine

14.
Huang, Furong.
Discovery of Latent Factors in High-dimensional Data Using Tensor * Methods*.

Degree: Electrical and Computer Engineering, 2016, University of California – Irvine

URL: http://www.escholarship.org/uc/item/97f3404j

► Unsupervised learning aims at the discovery of hidden structure that drives the observations in the real world. It is essential for success in modern machine…
(more)

Subjects/Keywords: Computer science; Latent Variable Graphical Model; Spectral Methods; Tensor Decomposition; Unsupervised Learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, F. (2016). Discovery of Latent Factors in High-dimensional Data Using Tensor Methods. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/97f3404j

Not specified: Masters Thesis or Doctoral Dissertation

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

Huang, Furong. “Discovery of Latent Factors in High-dimensional Data Using Tensor Methods.” 2016. Thesis, University of California – Irvine. Accessed December 09, 2019. http://www.escholarship.org/uc/item/97f3404j.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Furong. “Discovery of Latent Factors in High-dimensional Data Using Tensor Methods.” 2016. Web. 09 Dec 2019.

Vancouver:

Huang F. Discovery of Latent Factors in High-dimensional Data Using Tensor Methods. [Internet] [Thesis]. University of California – Irvine; 2016. [cited 2019 Dec 09]. Available from: http://www.escholarship.org/uc/item/97f3404j.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang F. Discovery of Latent Factors in High-dimensional Data Using Tensor Methods. [Thesis]. University of California – Irvine; 2016. Available from: http://www.escholarship.org/uc/item/97f3404j

Not specified: Masters Thesis or Doctoral Dissertation

15.
Haferssas, Ryadh Mohamed.
Espaces grossiers pour les méthodes de décomposition de domaine avec conditions d'interface optimisées : Coarse spaces for domain *decomposition* method with optimized transmission conditions.

Degree: Docteur es, Mathématiques Appliquées, 2016, Université Pierre et Marie Curie – Paris VI

URL: http://www.theses.fr/2016PA066450

►

L'objectif de cette thèse est la conception, l'analyse et l'implémentation d'une méthode de décomposition de domaine efficiente pour des problèmes de la mécanique des solides… (more)

Subjects/Keywords: Analyse; Décomposition; Domaines; Préconditioneurs; Performance; GenEO2; Calcul; Decomposition; HPC; Optimized Schwarz methods; 510

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Haferssas, R. M. (2016). Espaces grossiers pour les méthodes de décomposition de domaine avec conditions d'interface optimisées : Coarse spaces for domain decomposition method with optimized transmission conditions. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2016PA066450

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

Haferssas, Ryadh Mohamed. “Espaces grossiers pour les méthodes de décomposition de domaine avec conditions d'interface optimisées : Coarse spaces for domain decomposition method with optimized transmission conditions.” 2016. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed December 09, 2019. http://www.theses.fr/2016PA066450.

MLA Handbook (7^{th} Edition):

Haferssas, Ryadh Mohamed. “Espaces grossiers pour les méthodes de décomposition de domaine avec conditions d'interface optimisées : Coarse spaces for domain decomposition method with optimized transmission conditions.” 2016. Web. 09 Dec 2019.

Vancouver:

Haferssas RM. Espaces grossiers pour les méthodes de décomposition de domaine avec conditions d'interface optimisées : Coarse spaces for domain decomposition method with optimized transmission conditions. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. [cited 2019 Dec 09]. Available from: http://www.theses.fr/2016PA066450.

Council of Science Editors:

Haferssas RM. Espaces grossiers pour les méthodes de décomposition de domaine avec conditions d'interface optimisées : Coarse spaces for domain decomposition method with optimized transmission conditions. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. Available from: http://www.theses.fr/2016PA066450

University of Toronto

16. Zheng, Jason ZX. Block-based Adaptive Mesh Refinement Finite-volume Scheme for Hybrid Multi-block Meshes.

Degree: 2012, University of Toronto

URL: http://hdl.handle.net/1807/33623

►

A block-based adaptive mesh refinement (AMR) finite-volume scheme is developed for solution of hyperbolic conservation laws on two-dimensional hybrid multi-block meshes. A Godunov-type upwind finite-volume… (more)

Subjects/Keywords: upwind finite-volume methods; adaptive mesh refinement (AMR); block-based hybrid mesh; domain decomposition; 0538

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zheng, J. Z. (2012). Block-based Adaptive Mesh Refinement Finite-volume Scheme for Hybrid Multi-block Meshes. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/33623

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

Zheng, Jason ZX. “Block-based Adaptive Mesh Refinement Finite-volume Scheme for Hybrid Multi-block Meshes.” 2012. Masters Thesis, University of Toronto. Accessed December 09, 2019. http://hdl.handle.net/1807/33623.

MLA Handbook (7^{th} Edition):

Zheng, Jason ZX. “Block-based Adaptive Mesh Refinement Finite-volume Scheme for Hybrid Multi-block Meshes.” 2012. Web. 09 Dec 2019.

Vancouver:

Zheng JZ. Block-based Adaptive Mesh Refinement Finite-volume Scheme for Hybrid Multi-block Meshes. [Internet] [Masters thesis]. University of Toronto; 2012. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1807/33623.

Council of Science Editors:

Zheng JZ. Block-based Adaptive Mesh Refinement Finite-volume Scheme for Hybrid Multi-block Meshes. [Masters Thesis]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/33623

Rice University

17.
Wang, Yingpei.
On the approximation of the Dirichlet to Neumann map for high contrast two phase composites and its applications to domain *decomposition* * methods*.

Degree: PhD, Engineering, 2014, Rice University

URL: http://hdl.handle.net/1911/88418

► An asymptotic approximation of the Dirichlet to Neumann (DtN) map of high contrast composite media with perfectly conducting inclusions that are close to touching is…
(more)

Subjects/Keywords: Asymptotic approximation; high contrast; Dirichlet to Neumann Map; domain decomposition methods; preconditioner

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Y. (2014). On the approximation of the Dirichlet to Neumann map for high contrast two phase composites and its applications to domain decomposition methods. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/88418

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

Wang, Yingpei. “On the approximation of the Dirichlet to Neumann map for high contrast two phase composites and its applications to domain decomposition methods.” 2014. Doctoral Dissertation, Rice University. Accessed December 09, 2019. http://hdl.handle.net/1911/88418.

MLA Handbook (7^{th} Edition):

Wang, Yingpei. “On the approximation of the Dirichlet to Neumann map for high contrast two phase composites and its applications to domain decomposition methods.” 2014. Web. 09 Dec 2019.

Vancouver:

Wang Y. On the approximation of the Dirichlet to Neumann map for high contrast two phase composites and its applications to domain decomposition methods. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1911/88418.

Council of Science Editors:

Wang Y. On the approximation of the Dirichlet to Neumann map for high contrast two phase composites and its applications to domain decomposition methods. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/88418

University of Southern California

18.
Doyle, Patrick J.
Probability assessment: Continuous quantities and
probability * decomposition*.

Degree: PhD, Psychology, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/442855/rec/5238

► There has been a great deal of research conducted in the areas of probability assessment and calibration. However, a limited amount of research has been…
(more)

Subjects/Keywords: probability assessment; continuous random variables; subjective probability distributions; elicitation methods; probability decomposition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Doyle, P. J. (2011). Probability assessment: Continuous quantities and probability decomposition. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/442855/rec/5238

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

Doyle, Patrick J. “Probability assessment: Continuous quantities and probability decomposition.” 2011. Doctoral Dissertation, University of Southern California. Accessed December 09, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/442855/rec/5238.

MLA Handbook (7^{th} Edition):

Doyle, Patrick J. “Probability assessment: Continuous quantities and probability decomposition.” 2011. Web. 09 Dec 2019.

Vancouver:

Doyle PJ. Probability assessment: Continuous quantities and probability decomposition. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2019 Dec 09]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/442855/rec/5238.

Council of Science Editors:

Doyle PJ. Probability assessment: Continuous quantities and probability decomposition. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/442855/rec/5238

University of New South Wales

19. Pham, Thanh Duong. Pseudodifferential equations on spheres with spherical radial basis functions and spherical splines.

Degree: Mathematics & Statistics, 2011, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/50935 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9829/SOURCE02?view=true

► Pseudodifferential equations on the unit sphere in \R^{n}, n ≥ 3, are considered. The class of pseudodiffrential operators have long been used as a modern and…
(more)

Subjects/Keywords: Spherical radial basis functions; Pseudodifferential equations; Spheres; Spherical splines; Domain decomposition methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pham, T. D. (2011). Pseudodifferential equations on spheres with spherical radial basis functions and spherical splines. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/50935 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9829/SOURCE02?view=true

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

Pham, Thanh Duong. “Pseudodifferential equations on spheres with spherical radial basis functions and spherical splines.” 2011. Doctoral Dissertation, University of New South Wales. Accessed December 09, 2019. http://handle.unsw.edu.au/1959.4/50935 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9829/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

Pham, Thanh Duong. “Pseudodifferential equations on spheres with spherical radial basis functions and spherical splines.” 2011. Web. 09 Dec 2019.

Vancouver:

Pham TD. Pseudodifferential equations on spheres with spherical radial basis functions and spherical splines. [Internet] [Doctoral dissertation]. University of New South Wales; 2011. [cited 2019 Dec 09]. Available from: http://handle.unsw.edu.au/1959.4/50935 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9829/SOURCE02?view=true.

Council of Science Editors:

Pham TD. Pseudodifferential equations on spheres with spherical radial basis functions and spherical splines. [Doctoral Dissertation]. University of New South Wales; 2011. Available from: http://handle.unsw.edu.au/1959.4/50935 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9829/SOURCE02?view=true

University of Texas – Austin

20. Petrides, Socratis. Adaptive multilevel solvers for the discontinuous Petrov–Galerkin method with an emphasis on high-frequency wave propagation problems.

Degree: PhD, Computational Science, Engineering, and Mathematics, 2019, University of Texas – Austin

URL: http://dx.doi.org/10.26153/tsw/2153

► This dissertation focuses on the development of fast and efficient solution schemes for the simulation of challenging problems in wave propagation phenomena. In particular, emphasis…
(more)

Subjects/Keywords: Multilevel iterative solvers; High frequency wave propagation; High order finite element methods; Domain decomposition preconditioners

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Petrides, S. (2019). Adaptive multilevel solvers for the discontinuous Petrov–Galerkin method with an emphasis on high-frequency wave propagation problems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2153

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

Petrides, Socratis. “Adaptive multilevel solvers for the discontinuous Petrov–Galerkin method with an emphasis on high-frequency wave propagation problems.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed December 09, 2019. http://dx.doi.org/10.26153/tsw/2153.

MLA Handbook (7^{th} Edition):

Petrides, Socratis. “Adaptive multilevel solvers for the discontinuous Petrov–Galerkin method with an emphasis on high-frequency wave propagation problems.” 2019. Web. 09 Dec 2019.

Vancouver:

Petrides S. Adaptive multilevel solvers for the discontinuous Petrov–Galerkin method with an emphasis on high-frequency wave propagation problems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2019 Dec 09]. Available from: http://dx.doi.org/10.26153/tsw/2153.

Council of Science Editors:

Petrides S. Adaptive multilevel solvers for the discontinuous Petrov–Galerkin method with an emphasis on high-frequency wave propagation problems. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2153

RMIT University

21.
Liu, S.
New bundle *methods* and U-Lagrangian for generic nonsmooth optimization.

Degree: 2016, RMIT University

URL: http://researchbank.rmit.edu.au/view/rmit:161727

► Nonsmooth optimization consists of minimizing a continuous function by systematically choosing iterative points from the feasible set via the computation of function values and generalized…
(more)

Subjects/Keywords: Fields of Research; Bundle methods; Linear programming; Nonsmooth optimization; UV decomposition; Prox-regular; Trust region methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, S. (2016). New bundle methods and U-Lagrangian for generic nonsmooth optimization. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:161727

Not specified: Masters Thesis or Doctoral Dissertation

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

Liu, S. “New bundle methods and U-Lagrangian for generic nonsmooth optimization.” 2016. Thesis, RMIT University. Accessed December 09, 2019. http://researchbank.rmit.edu.au/view/rmit:161727.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, S. “New bundle methods and U-Lagrangian for generic nonsmooth optimization.” 2016. Web. 09 Dec 2019.

Vancouver:

Liu S. New bundle methods and U-Lagrangian for generic nonsmooth optimization. [Internet] [Thesis]. RMIT University; 2016. [cited 2019 Dec 09]. Available from: http://researchbank.rmit.edu.au/view/rmit:161727.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu S. New bundle methods and U-Lagrangian for generic nonsmooth optimization. [Thesis]. RMIT University; 2016. Available from: http://researchbank.rmit.edu.au/view/rmit:161727

Not specified: Masters Thesis or Doctoral Dissertation

22. Vu, Thi Thanh Xuan. Optimisation déterministe et stochastique pour des problèmes de traitement d'images en grande dimension : Deterministic and stochastic optimization for solving large size inverse problems in image processing.

Degree: Docteur es, Mathématiques et informatique. Mathématiques, 2017, Aix Marseille Université

URL: http://www.theses.fr/2017AIXM0540

►

Dans cette thèse on s’intéresse au problème des décompositions canoniques polyadiques de tenseurs d’ordre N potentiellement grands et sous différentes contraintes (non-négativité, aspect creux lié… (more)

Subjects/Keywords: .; Canonical Polyadic Decomposition; Tensor; Gradient approaches; Memetic methods; Proximal methods; Fluorescence spectroscopy; Large dimensions; Bc-Vmfb

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vu, T. T. X. (2017). Optimisation déterministe et stochastique pour des problèmes de traitement d'images en grande dimension : Deterministic and stochastic optimization for solving large size inverse problems in image processing. (Doctoral Dissertation). Aix Marseille Université. Retrieved from http://www.theses.fr/2017AIXM0540

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

Vu, Thi Thanh Xuan. “Optimisation déterministe et stochastique pour des problèmes de traitement d'images en grande dimension : Deterministic and stochastic optimization for solving large size inverse problems in image processing.” 2017. Doctoral Dissertation, Aix Marseille Université. Accessed December 09, 2019. http://www.theses.fr/2017AIXM0540.

MLA Handbook (7^{th} Edition):

Vu, Thi Thanh Xuan. “Optimisation déterministe et stochastique pour des problèmes de traitement d'images en grande dimension : Deterministic and stochastic optimization for solving large size inverse problems in image processing.” 2017. Web. 09 Dec 2019.

Vancouver:

Vu TTX. Optimisation déterministe et stochastique pour des problèmes de traitement d'images en grande dimension : Deterministic and stochastic optimization for solving large size inverse problems in image processing. [Internet] [Doctoral dissertation]. Aix Marseille Université 2017. [cited 2019 Dec 09]. Available from: http://www.theses.fr/2017AIXM0540.

Council of Science Editors:

Vu TTX. Optimisation déterministe et stochastique pour des problèmes de traitement d'images en grande dimension : Deterministic and stochastic optimization for solving large size inverse problems in image processing. [Doctoral Dissertation]. Aix Marseille Université 2017. Available from: http://www.theses.fr/2017AIXM0540

23.
Li, Jizhou.
High order discontinuous Galerkin *methods* for simulating miscible displacement process in porous media with a focus on minimal regularity.

Degree: PhD, Engineering, 2015, Rice University

URL: http://hdl.handle.net/1911/88087

► In my thesis, I formulate, analyze and implement high order discontinuous Galerkin *methods* for simulating miscible displacement in porous media. The analysis concerning the stability…
(more)

Subjects/Keywords: discontinuous Galerkin methods; miscible displacement; reservoir simulations; high performance computing; high order methods; viscous fingering; algebraic multigrid; domain decomposition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, J. (2015). High order discontinuous Galerkin methods for simulating miscible displacement process in porous media with a focus on minimal regularity. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/88087

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

Li, Jizhou. “High order discontinuous Galerkin methods for simulating miscible displacement process in porous media with a focus on minimal regularity.” 2015. Doctoral Dissertation, Rice University. Accessed December 09, 2019. http://hdl.handle.net/1911/88087.

MLA Handbook (7^{th} Edition):

Li, Jizhou. “High order discontinuous Galerkin methods for simulating miscible displacement process in porous media with a focus on minimal regularity.” 2015. Web. 09 Dec 2019.

Vancouver:

Li J. High order discontinuous Galerkin methods for simulating miscible displacement process in porous media with a focus on minimal regularity. [Internet] [Doctoral dissertation]. Rice University; 2015. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1911/88087.

Council of Science Editors:

Li J. High order discontinuous Galerkin methods for simulating miscible displacement process in porous media with a focus on minimal regularity. [Doctoral Dissertation]. Rice University; 2015. Available from: http://hdl.handle.net/1911/88087

University of Bath

24.
Blake, Jack.
Domain *decomposition* *methods* for nuclear reactor modelling with diffusion acceleration.

Degree: PhD, 2016, University of Bath

URL: https://researchportal.bath.ac.uk/en/studentthesis/domain-decomposition-methods-for-nuclear-reactor-modelling-with-diffusion-acceleration(9ab4a25f-c342-4d18-b39a-40a25e8cf020).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.698988

► In this thesis we study *methods* for solving the neutron transport equation (or linear Boltzmann equation). This is an integro-differential equation that describes the behaviour…
(more)

Subjects/Keywords: 518; domain decomposition; neutron transport; Boltzmann equation; diffusion acceleration; iterative methods; nuclear; diffusion synthetic acceleration; numerical analysis; Convergence of numerical methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Blake, J. (2016). Domain decomposition methods for nuclear reactor modelling with diffusion acceleration. (Doctoral Dissertation). University of Bath. Retrieved from https://researchportal.bath.ac.uk/en/studentthesis/domain-decomposition-methods-for-nuclear-reactor-modelling-with-diffusion-acceleration(9ab4a25f-c342-4d18-b39a-40a25e8cf020).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.698988

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

Blake, Jack. “Domain decomposition methods for nuclear reactor modelling with diffusion acceleration.” 2016. Doctoral Dissertation, University of Bath. Accessed December 09, 2019. https://researchportal.bath.ac.uk/en/studentthesis/domain-decomposition-methods-for-nuclear-reactor-modelling-with-diffusion-acceleration(9ab4a25f-c342-4d18-b39a-40a25e8cf020).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.698988.

MLA Handbook (7^{th} Edition):

Blake, Jack. “Domain decomposition methods for nuclear reactor modelling with diffusion acceleration.” 2016. Web. 09 Dec 2019.

Vancouver:

Blake J. Domain decomposition methods for nuclear reactor modelling with diffusion acceleration. [Internet] [Doctoral dissertation]. University of Bath; 2016. [cited 2019 Dec 09]. Available from: https://researchportal.bath.ac.uk/en/studentthesis/domain-decomposition-methods-for-nuclear-reactor-modelling-with-diffusion-acceleration(9ab4a25f-c342-4d18-b39a-40a25e8cf020).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.698988.

Council of Science Editors:

Blake J. Domain decomposition methods for nuclear reactor modelling with diffusion acceleration. [Doctoral Dissertation]. University of Bath; 2016. Available from: https://researchportal.bath.ac.uk/en/studentthesis/domain-decomposition-methods-for-nuclear-reactor-modelling-with-diffusion-acceleration(9ab4a25f-c342-4d18-b39a-40a25e8cf020).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.698988

25.
Garaschuk, Kseniya.
Linear *methods* for rational triangle decompositions.

Degree: Department of Mathematics and Statistics, 2014, University of Victoria

URL: http://hdl.handle.net/1828/5665

► Given a graph G, a K_3-*decomposition* of G, also called a triangle *decomposition*, is a set of subgraphs isomorphic to K_3 whose edges partition the…
(more)

Subjects/Keywords: triangle decomposition; linear methods; design theory; graph decomposition

…viii
List of Figures
Figure 1.1
Figure 1.2
Figure 1.3
Triangle *decomposition* of K9 − C9… …2.6
2.7
2.8
2.9
*Decomposition* of the Petersen graph into a tree. . . . . . . . .
Affine… …Binary star applied to G = 2Kv/2 + M . . . . . . . . . . .
Triangle *decomposition* of the… …Definition 1.1. Given a simple graph G, a K3 -*decomposition* of G, also called a
triangle… …*decomposition* or triangulation, is a set of subgraphs isomorphic to K3 whose
edges partition the edge…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garaschuk, K. (2014). Linear methods for rational triangle decompositions. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5665

Not specified: Masters Thesis or Doctoral Dissertation

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

Garaschuk, Kseniya. “Linear methods for rational triangle decompositions.” 2014. Thesis, University of Victoria. Accessed December 09, 2019. http://hdl.handle.net/1828/5665.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Garaschuk, Kseniya. “Linear methods for rational triangle decompositions.” 2014. Web. 09 Dec 2019.

Vancouver:

Garaschuk K. Linear methods for rational triangle decompositions. [Internet] [Thesis]. University of Victoria; 2014. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1828/5665.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Garaschuk K. Linear methods for rational triangle decompositions. [Thesis]. University of Victoria; 2014. Available from: http://hdl.handle.net/1828/5665

Not specified: Masters Thesis or Doctoral Dissertation

University of South Africa

26.
Ncube, Mahluli Naisbitt.
The natural transform *decomposition* method for solving fractional differential equations
.

Degree: 2018, University of South Africa

URL: http://hdl.handle.net/10500/25348

► In this dissertation, we use the Natural transform *decomposition* method to obtain approximate analytical solution of fractional differential equations. This technique is a combination of…
(more)

Subjects/Keywords: Fractional differential equations; Special functions; Natural transform; Decomposition methods; Caputo fractional derivative; Caputo-Fabrizio fractional derivative; Adomian decomposition method; Homotopy perturbation method; Daftardar-Jafari method; Integral transform

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ncube, M. N. (2018). The natural transform decomposition method for solving fractional differential equations . (Masters Thesis). University of South Africa. Retrieved from http://hdl.handle.net/10500/25348

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

Ncube, Mahluli Naisbitt. “The natural transform decomposition method for solving fractional differential equations .” 2018. Masters Thesis, University of South Africa. Accessed December 09, 2019. http://hdl.handle.net/10500/25348.

MLA Handbook (7^{th} Edition):

Ncube, Mahluli Naisbitt. “The natural transform decomposition method for solving fractional differential equations .” 2018. Web. 09 Dec 2019.

Vancouver:

Ncube MN. The natural transform decomposition method for solving fractional differential equations . [Internet] [Masters thesis]. University of South Africa; 2018. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10500/25348.

Council of Science Editors:

Ncube MN. The natural transform decomposition method for solving fractional differential equations . [Masters Thesis]. University of South Africa; 2018. Available from: http://hdl.handle.net/10500/25348

RMIT University

27.
Mohammadi, A.
Integrating *decomposition* *methods* with user preferences for solving many-objective optimization problems.

Degree: 2018, RMIT University

URL: http://researchbank.rmit.edu.au/view/rmit:162400

► This research aims to investigate *methods* to solve many-objective (a multi-objective problem with three or more objectives) optimization problems. To achieve this, we propose an…
(more)

Subjects/Keywords: Fields of Research; Many-objective Optimization; Multi-objective Optimization; Decomposition Methods; User-preference approaches; Weight vector Adoption

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mohammadi, A. (2018). Integrating decomposition methods with user preferences for solving many-objective optimization problems. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162400

Not specified: Masters Thesis or Doctoral Dissertation

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

Mohammadi, A. “Integrating decomposition methods with user preferences for solving many-objective optimization problems.” 2018. Thesis, RMIT University. Accessed December 09, 2019. http://researchbank.rmit.edu.au/view/rmit:162400.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mohammadi, A. “Integrating decomposition methods with user preferences for solving many-objective optimization problems.” 2018. Web. 09 Dec 2019.

Vancouver:

Mohammadi A. Integrating decomposition methods with user preferences for solving many-objective optimization problems. [Internet] [Thesis]. RMIT University; 2018. [cited 2019 Dec 09]. Available from: http://researchbank.rmit.edu.au/view/rmit:162400.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mohammadi A. Integrating decomposition methods with user preferences for solving many-objective optimization problems. [Thesis]. RMIT University; 2018. Available from: http://researchbank.rmit.edu.au/view/rmit:162400

Not specified: Masters Thesis or Doctoral Dissertation

28. Santos, Fernanda Cabral. A redução do trabalho infantil e o aumento da freqüência escolar na década de 90 no Brasil.

Degree: Mestrado, Economia das Instituições e do Desenvolvimento, 2007, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/12/12140/tde-23042007-145146/ ;

►

Os anos noventa no Brasil foram marcados pela simultânea queda do trabalho infantil e aumento da freqüência escolar. Este estudo se propôs a investigar as… (more)

Subjects/Keywords: Child labor; Decomposition methods; Freqüência escolar - Brasil; Métodos de decomposição; School attendance - Brazil; Trabalho de menor

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Santos, F. C. (2007). A redução do trabalho infantil e o aumento da freqüência escolar na década de 90 no Brasil. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/12/12140/tde-23042007-145146/ ;

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

Santos, Fernanda Cabral. “A redução do trabalho infantil e o aumento da freqüência escolar na década de 90 no Brasil.” 2007. Masters Thesis, University of São Paulo. Accessed December 09, 2019. http://www.teses.usp.br/teses/disponiveis/12/12140/tde-23042007-145146/ ;.

MLA Handbook (7^{th} Edition):

Santos, Fernanda Cabral. “A redução do trabalho infantil e o aumento da freqüência escolar na década de 90 no Brasil.” 2007. Web. 09 Dec 2019.

Vancouver:

Santos FC. A redução do trabalho infantil e o aumento da freqüência escolar na década de 90 no Brasil. [Internet] [Masters thesis]. University of São Paulo; 2007. [cited 2019 Dec 09]. Available from: http://www.teses.usp.br/teses/disponiveis/12/12140/tde-23042007-145146/ ;.

Council of Science Editors:

Santos FC. A redução do trabalho infantil e o aumento da freqüência escolar na década de 90 no Brasil. [Masters Thesis]. University of São Paulo; 2007. Available from: http://www.teses.usp.br/teses/disponiveis/12/12140/tde-23042007-145146/ ;

29. Munari Junior, Pedro Augusto. Técnicas computacionais para a implementação eficiente e estável de métodos tipo simplex.

Degree: Mestrado, Ciências de Computação e Matemática Computacional, 2009, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26052009-150427/ ;

►

Métodos tipo simplex são a base dos principais softwares utilizados na resolução de problemas de otimização linear. A implementação computacional direta destes métodos, assim como… (more)

Subjects/Keywords: Decomposição LU; Esparsidade; LU decomposition; Métodos tipo simplex; Mudança de escala; Scaling sparsity; Simplex type methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Munari Junior, P. A. (2009). Técnicas computacionais para a implementação eficiente e estável de métodos tipo simplex. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26052009-150427/ ;

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

Munari Junior, Pedro Augusto. “Técnicas computacionais para a implementação eficiente e estável de métodos tipo simplex.” 2009. Masters Thesis, University of São Paulo. Accessed December 09, 2019. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26052009-150427/ ;.

MLA Handbook (7^{th} Edition):

Munari Junior, Pedro Augusto. “Técnicas computacionais para a implementação eficiente e estável de métodos tipo simplex.” 2009. Web. 09 Dec 2019.

Vancouver:

Munari Junior PA. Técnicas computacionais para a implementação eficiente e estável de métodos tipo simplex. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2019 Dec 09]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26052009-150427/ ;.

Council of Science Editors:

Munari Junior PA. Técnicas computacionais para a implementação eficiente e estável de métodos tipo simplex. [Masters Thesis]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26052009-150427/ ;

The Ohio State University

30.
Zhao, Kezhong.
A domain *decomposition* method for solving electrically large
electromagnetic problems.

Degree: PhD, Electrical Engineering, 2007, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1189694496

► This dissertation presents a domain *decomposition* method as an effective and efficient preconditioner for frequency domain FEM solution of geometrically complex and electrically large electromagnetic…
(more)

Subjects/Keywords: numerical methods; computational electromagnetics; domain decomposition method; finite element method; hybrid finite element and boundary element method; multi-region method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhao, K. (2007). A domain decomposition method for solving electrically large electromagnetic problems. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1189694496

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

Zhao, Kezhong. “A domain decomposition method for solving electrically large electromagnetic problems.” 2007. Doctoral Dissertation, The Ohio State University. Accessed December 09, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1189694496.

MLA Handbook (7^{th} Edition):

Zhao, Kezhong. “A domain decomposition method for solving electrically large electromagnetic problems.” 2007. Web. 09 Dec 2019.

Vancouver:

Zhao K. A domain decomposition method for solving electrically large electromagnetic problems. [Internet] [Doctoral dissertation]. The Ohio State University; 2007. [cited 2019 Dec 09]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1189694496.

Council of Science Editors:

Zhao K. A domain decomposition method for solving electrically large electromagnetic problems. [Doctoral Dissertation]. The Ohio State University; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1189694496