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:(polynomial systems). Showing records 1 – 30 of 75 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


University of Waterloo

1. Vu, Thi Xuan. Homotopy algorithms for solving structured determinantal systems.

Degree: 2020, University of Waterloo

 Multivariate polynomial systems arising in numerous applications have special structures. In particular, determinantal structures and invariant systems appear in a wide range of applications such… (more)

Subjects/Keywords: symbolic computation; polynomial systems solving; symbolic homotopy continuation; determinantal systems; invariant algebraic systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vu, T. X. (2020). Homotopy algorithms for solving structured determinantal systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16566

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

Vu, Thi Xuan. “Homotopy algorithms for solving structured determinantal systems.” 2020. Thesis, University of Waterloo. Accessed January 23, 2021. http://hdl.handle.net/10012/16566.

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

MLA Handbook (7th Edition):

Vu, Thi Xuan. “Homotopy algorithms for solving structured determinantal systems.” 2020. Web. 23 Jan 2021.

Vancouver:

Vu TX. Homotopy algorithms for solving structured determinantal systems. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10012/16566.

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

Council of Science Editors:

Vu TX. Homotopy algorithms for solving structured determinantal systems. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16566

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


Colorado State University

2. Ihde, Steven L. Preconditioning polynomial systems for homotopy continuation.

Degree: MS(M.S.), Mathematics, 2011, Colorado State University

Polynomial systems are ubiquitous in today's scientific world. These systems need to be solved quickly and efficiently. One key solution method comes from Numerical Algebraic… (more)

Subjects/Keywords: dual basis; polynomial systems; numerical algebraic geometry; homotopy continuation; H-basis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ihde, S. L. (2011). Preconditioning polynomial systems for homotopy continuation. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/51875

Chicago Manual of Style (16th Edition):

Ihde, Steven L. “Preconditioning polynomial systems for homotopy continuation.” 2011. Masters Thesis, Colorado State University. Accessed January 23, 2021. http://hdl.handle.net/10217/51875.

MLA Handbook (7th Edition):

Ihde, Steven L. “Preconditioning polynomial systems for homotopy continuation.” 2011. Web. 23 Jan 2021.

Vancouver:

Ihde SL. Preconditioning polynomial systems for homotopy continuation. [Internet] [Masters thesis]. Colorado State University; 2011. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10217/51875.

Council of Science Editors:

Ihde SL. Preconditioning polynomial systems for homotopy continuation. [Masters Thesis]. Colorado State University; 2011. Available from: http://hdl.handle.net/10217/51875


University of Miami

3. Masterjohn, Joseph. Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves.

Degree: MS, Computer Science (Arts and Sciences), 2017, University of Miami

  One of the fundamental concepts in computational geometry is deducing the combinatorial structure, or interactions, of a group of static geometric objects. In two… (more)

Subjects/Keywords: computational geometry; arrangements; algebraic curves; algorithms; intersections; polynomial systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Masterjohn, J. (2017). Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. (Thesis). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_theses/699

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

Masterjohn, Joseph. “Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves.” 2017. Thesis, University of Miami. Accessed January 23, 2021. https://scholarlyrepository.miami.edu/oa_theses/699.

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

MLA Handbook (7th Edition):

Masterjohn, Joseph. “Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves.” 2017. Web. 23 Jan 2021.

Vancouver:

Masterjohn J. Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. [Internet] [Thesis]. University of Miami; 2017. [cited 2021 Jan 23]. Available from: https://scholarlyrepository.miami.edu/oa_theses/699.

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

Council of Science Editors:

Masterjohn J. Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. [Thesis]. University of Miami; 2017. Available from: https://scholarlyrepository.miami.edu/oa_theses/699

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


University of Melbourne

4. SLEIGH, CALLUM. Eynard-Orantin theory of the A-polynomial.

Degree: 2013, University of Melbourne

 This thesis studies the Eynard-Orantin invariants of an important knot invariant: the A-polynomial. In particular, period integrals of the Eynard-Orantin invariants are studied. First, formulae… (more)

Subjects/Keywords: A-polynomial; Chern-Simons Theory; integrable systems; topological recursion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SLEIGH, C. (2013). Eynard-Orantin theory of the A-polynomial. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/38442

Chicago Manual of Style (16th Edition):

SLEIGH, CALLUM. “Eynard-Orantin theory of the A-polynomial.” 2013. Doctoral Dissertation, University of Melbourne. Accessed January 23, 2021. http://hdl.handle.net/11343/38442.

MLA Handbook (7th Edition):

SLEIGH, CALLUM. “Eynard-Orantin theory of the A-polynomial.” 2013. Web. 23 Jan 2021.

Vancouver:

SLEIGH C. Eynard-Orantin theory of the A-polynomial. [Internet] [Doctoral dissertation]. University of Melbourne; 2013. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/11343/38442.

Council of Science Editors:

SLEIGH C. Eynard-Orantin theory of the A-polynomial. [Doctoral Dissertation]. University of Melbourne; 2013. Available from: http://hdl.handle.net/11343/38442


Laurentian University

5. Wang, Zhenheng. Model based fault detection for two-dimensional systems .

Degree: 2014, Laurentian University

 Fault detection and isolation (FDI) are essential in ensuring safe and reliable operations in industrial systems. Extensive research has been carried out on FDI for… (more)

Subjects/Keywords: Two dimensional systems; Fault detection; Kalman filter; Polynomial theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Z. (2014). Model based fault detection for two-dimensional systems . (Thesis). Laurentian University. Retrieved from https://zone.biblio.laurentian.ca/dspace/handle/10219/2186

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

Wang, Zhenheng. “Model based fault detection for two-dimensional systems .” 2014. Thesis, Laurentian University. Accessed January 23, 2021. https://zone.biblio.laurentian.ca/dspace/handle/10219/2186.

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

MLA Handbook (7th Edition):

Wang, Zhenheng. “Model based fault detection for two-dimensional systems .” 2014. Web. 23 Jan 2021.

Vancouver:

Wang Z. Model based fault detection for two-dimensional systems . [Internet] [Thesis]. Laurentian University; 2014. [cited 2021 Jan 23]. Available from: https://zone.biblio.laurentian.ca/dspace/handle/10219/2186.

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

Council of Science Editors:

Wang Z. Model based fault detection for two-dimensional systems . [Thesis]. Laurentian University; 2014. Available from: https://zone.biblio.laurentian.ca/dspace/handle/10219/2186

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


Virginia Tech

6. Hinkelmann, Franziska Babette. Algebraic theory for discrete models in systems biology.

Degree: PhD, Mathematics, 2011, Virginia Tech

 This dissertation develops algebraic theory for discrete models in systems biology. Many discrete model types can be translated into the framework of polynomial dynamical systems(more)

Subjects/Keywords: systems biology; discrete models; Mathematical biology; finite fields; reverse-engineering; polynomial dynamical systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hinkelmann, F. B. (2011). Algebraic theory for discrete models in systems biology. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28509

Chicago Manual of Style (16th Edition):

Hinkelmann, Franziska Babette. “Algebraic theory for discrete models in systems biology.” 2011. Doctoral Dissertation, Virginia Tech. Accessed January 23, 2021. http://hdl.handle.net/10919/28509.

MLA Handbook (7th Edition):

Hinkelmann, Franziska Babette. “Algebraic theory for discrete models in systems biology.” 2011. Web. 23 Jan 2021.

Vancouver:

Hinkelmann FB. Algebraic theory for discrete models in systems biology. [Internet] [Doctoral dissertation]. Virginia Tech; 2011. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10919/28509.

Council of Science Editors:

Hinkelmann FB. Algebraic theory for discrete models in systems biology. [Doctoral Dissertation]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/28509

7. Dehornoy, Pierre. Invariants topologiques des orbites périodiques d'un champ de vecteurs : Topological invariants of the periodic orbits of a vector field.

Degree: Docteur es, Mathématiques, 2011, Lyon, École normale supérieure

Cette thèse se situe à l’interface entre théorie des nœuds et théorie des systèmes dynamiques. Le thème central consiste, étant donné un champ de vecteurs… (more)

Subjects/Keywords: Noeud fibré; Noeud de Lorenz; Dynamical systems; Topology; Fibered knot; Lorenz knot; Alexander polynomial

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dehornoy, P. (2011). Invariants topologiques des orbites périodiques d'un champ de vecteurs : Topological invariants of the periodic orbits of a vector field. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2011ENSL0626

Chicago Manual of Style (16th Edition):

Dehornoy, Pierre. “Invariants topologiques des orbites périodiques d'un champ de vecteurs : Topological invariants of the periodic orbits of a vector field.” 2011. Doctoral Dissertation, Lyon, École normale supérieure. Accessed January 23, 2021. http://www.theses.fr/2011ENSL0626.

MLA Handbook (7th Edition):

Dehornoy, Pierre. “Invariants topologiques des orbites périodiques d'un champ de vecteurs : Topological invariants of the periodic orbits of a vector field.” 2011. Web. 23 Jan 2021.

Vancouver:

Dehornoy P. Invariants topologiques des orbites périodiques d'un champ de vecteurs : Topological invariants of the periodic orbits of a vector field. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2011. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2011ENSL0626.

Council of Science Editors:

Dehornoy P. Invariants topologiques des orbites périodiques d'un champ de vecteurs : Topological invariants of the periodic orbits of a vector field. [Doctoral Dissertation]. Lyon, École normale supérieure; 2011. Available from: http://www.theses.fr/2011ENSL0626


University of Illinois – Chicago

8. Bliss, Nathan R. Computing Series Expansions of Algebraic Space Curves.

Degree: 2018, University of Illinois – Chicago

 We work towards a series-based computational approach for polynomial systems having positive-dimensional solution sets. The tropical variety gives information on the exponents of the leading… (more)

Subjects/Keywords: computational algebraic geometry; puiseux series; gauss-newton algorithm; tropical geometry; polynomial systems; homotopy continuation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bliss, N. R. (2018). Computing Series Expansions of Algebraic Space Curves. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22682

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

Bliss, Nathan R. “Computing Series Expansions of Algebraic Space Curves.” 2018. Thesis, University of Illinois – Chicago. Accessed January 23, 2021. http://hdl.handle.net/10027/22682.

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

MLA Handbook (7th Edition):

Bliss, Nathan R. “Computing Series Expansions of Algebraic Space Curves.” 2018. Web. 23 Jan 2021.

Vancouver:

Bliss NR. Computing Series Expansions of Algebraic Space Curves. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10027/22682.

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

Council of Science Editors:

Bliss NR. Computing Series Expansions of Algebraic Space Curves. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22682

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


University of Notre Dame

9. Timothy M McCoy. Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>.

Degree: Applied and Computational Mathematics and Statistics, 2014, University of Notre Dame

  Algorithms from the field of numerical algebraic geometry provide robust means to compute all isolated solutions of arbitrary systems of polynomials and to give… (more)

Subjects/Keywords: algebraic computation; numerical algebraic geometry; homotopy continuation; computational mathematics; polynomial systems; boundary value problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McCoy, T. M. (2014). Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/6395w66528z

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

McCoy, Timothy M. “Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>.” 2014. Thesis, University of Notre Dame. Accessed January 23, 2021. https://curate.nd.edu/show/6395w66528z.

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

MLA Handbook (7th Edition):

McCoy, Timothy M. “Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>.” 2014. Web. 23 Jan 2021.

Vancouver:

McCoy TM. Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>. [Internet] [Thesis]. University of Notre Dame; 2014. [cited 2021 Jan 23]. Available from: https://curate.nd.edu/show/6395w66528z.

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

Council of Science Editors:

McCoy TM. Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>. [Thesis]. University of Notre Dame; 2014. Available from: https://curate.nd.edu/show/6395w66528z

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


University of Waterloo

10. Melczer, Stephen. Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration.

Degree: 2017, University of Waterloo

 The field of analytic combinatorics, which studies the asymptotic behaviour of sequences through analytic properties of their generating functions, has led to the development of… (more)

Subjects/Keywords: Analytic Combinatorics; Enumerative Combinatorics; Singularity Analysis; Computer Algebra; Lattice Paths; Rational Diagonals; Polynomial Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Melczer, S. (2017). Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12039

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

Melczer, Stephen. “Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration.” 2017. Thesis, University of Waterloo. Accessed January 23, 2021. http://hdl.handle.net/10012/12039.

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

MLA Handbook (7th Edition):

Melczer, Stephen. “Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration.” 2017. Web. 23 Jan 2021.

Vancouver:

Melczer S. Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10012/12039.

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

Council of Science Editors:

Melczer S. Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12039

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


Northeastern University

11. Brunet, Pascal Maurice. Nonlinear system modeling and identification of loudspeakers.

Degree: PhD, Department of Electrical and Computer Engineering, 2014, Northeastern University

 This dissertation considers modeling and identification of nonlinear systems pertinent to loudspeakers with nonlinear distortion effects. It is well known that when loudspeakers are driven… (more)

Subjects/Keywords: fractional order systems; loudspeakers; nonlinear systems; polynomial state-space model; system identification; Acoustics, Dynamics, and Controls; Electrical and Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brunet, P. M. (2014). Nonlinear system modeling and identification of loudspeakers. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/d20004964

Chicago Manual of Style (16th Edition):

Brunet, Pascal Maurice. “Nonlinear system modeling and identification of loudspeakers.” 2014. Doctoral Dissertation, Northeastern University. Accessed January 23, 2021. http://hdl.handle.net/2047/d20004964.

MLA Handbook (7th Edition):

Brunet, Pascal Maurice. “Nonlinear system modeling and identification of loudspeakers.” 2014. Web. 23 Jan 2021.

Vancouver:

Brunet PM. Nonlinear system modeling and identification of loudspeakers. [Internet] [Doctoral dissertation]. Northeastern University; 2014. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/2047/d20004964.

Council of Science Editors:

Brunet PM. Nonlinear system modeling and identification of loudspeakers. [Doctoral Dissertation]. Northeastern University; 2014. Available from: http://hdl.handle.net/2047/d20004964


Université de Grenoble

12. Ben Sassi, Mohamed Amin. Analyse et contrôle des systèmes dynamiques polynomiaux : Analysis and Control of Polynomial Dynamical Systems.

Degree: Docteur es, Mathématiques appliquées, 2013, Université de Grenoble

Cette thèse présente une étude des systèmes dynamiques polynomiaux motivée à la fois par le grand spectre d'applications de cetteclasse (modèles de réactions chimiques, modèles… (more)

Subjects/Keywords: Systèmes dynamiques; Optimisation polynomiale; Programmation linéaire; Contrôle; Abstraction; Dynamical systems; Polynomial optimization; Linear programming; Control; Abstraction; 620

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ben Sassi, M. A. (2013). Analyse et contrôle des systèmes dynamiques polynomiaux : Analysis and Control of Polynomial Dynamical Systems. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2013GRENM005

Chicago Manual of Style (16th Edition):

Ben Sassi, Mohamed Amin. “Analyse et contrôle des systèmes dynamiques polynomiaux : Analysis and Control of Polynomial Dynamical Systems.” 2013. Doctoral Dissertation, Université de Grenoble. Accessed January 23, 2021. http://www.theses.fr/2013GRENM005.

MLA Handbook (7th Edition):

Ben Sassi, Mohamed Amin. “Analyse et contrôle des systèmes dynamiques polynomiaux : Analysis and Control of Polynomial Dynamical Systems.” 2013. Web. 23 Jan 2021.

Vancouver:

Ben Sassi MA. Analyse et contrôle des systèmes dynamiques polynomiaux : Analysis and Control of Polynomial Dynamical Systems. [Internet] [Doctoral dissertation]. Université de Grenoble; 2013. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2013GRENM005.

Council of Science Editors:

Ben Sassi MA. Analyse et contrôle des systèmes dynamiques polynomiaux : Analysis and Control of Polynomial Dynamical Systems. [Doctoral Dissertation]. Université de Grenoble; 2013. Available from: http://www.theses.fr/2013GRENM005


Delft University of Technology

13. Perkó, Z. Sensitivity and Uncertainty Analysis of Coupled Reactor Physics Problems: Method Development for Multi-Physics in Reactors.

Degree: 2015, Delft University of Technology

 This thesis presents novel adjoint and spectral methods for the sensitivity and uncertainty (S&U) analysis of multi-physics problems encountered in the field of reactor physics.… (more)

Subjects/Keywords: sensitivity analysis; uncertainty quantification; adjoint; polynomial chaos; coupled systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Perkó, Z. (2015). Sensitivity and Uncertainty Analysis of Coupled Reactor Physics Problems: Method Development for Multi-Physics in Reactors. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; urn:NBN:nl:ui:24-uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; urn:NBN:nl:ui:24-uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; http://resolver.tudelft.nl/uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c

Chicago Manual of Style (16th Edition):

Perkó, Z. “Sensitivity and Uncertainty Analysis of Coupled Reactor Physics Problems: Method Development for Multi-Physics in Reactors.” 2015. Doctoral Dissertation, Delft University of Technology. Accessed January 23, 2021. http://resolver.tudelft.nl/uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; urn:NBN:nl:ui:24-uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; urn:NBN:nl:ui:24-uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; http://resolver.tudelft.nl/uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c.

MLA Handbook (7th Edition):

Perkó, Z. “Sensitivity and Uncertainty Analysis of Coupled Reactor Physics Problems: Method Development for Multi-Physics in Reactors.” 2015. Web. 23 Jan 2021.

Vancouver:

Perkó Z. Sensitivity and Uncertainty Analysis of Coupled Reactor Physics Problems: Method Development for Multi-Physics in Reactors. [Internet] [Doctoral dissertation]. Delft University of Technology; 2015. [cited 2021 Jan 23]. Available from: http://resolver.tudelft.nl/uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; urn:NBN:nl:ui:24-uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; urn:NBN:nl:ui:24-uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; http://resolver.tudelft.nl/uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c.

Council of Science Editors:

Perkó Z. Sensitivity and Uncertainty Analysis of Coupled Reactor Physics Problems: Method Development for Multi-Physics in Reactors. [Doctoral Dissertation]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; urn:NBN:nl:ui:24-uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; urn:NBN:nl:ui:24-uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c ; http://resolver.tudelft.nl/uuid:2a55e581-acc0-4cbf-a8cf-9675986b9a0c


University of Notre Dame

14. Jonathan David Hauenstein. Regeneration, local dimension, and applications in numerical algebraic geometry</h1>.

Degree: Mathematics, 2009, University of Notre Dame

  Algorithms in the field of numerical algebraic geometry provide numerical methods for computing and manipulating solution sets of polynomial systems. One of the main… (more)

Subjects/Keywords: regeneration; polynomial systems; numerical algebraic geometry; local dimension; Bertini

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hauenstein, J. D. (2009). Regeneration, local dimension, and applications in numerical algebraic geometry</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/w3763487g2w

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

Hauenstein, Jonathan David. “Regeneration, local dimension, and applications in numerical algebraic geometry</h1>.” 2009. Thesis, University of Notre Dame. Accessed January 23, 2021. https://curate.nd.edu/show/w3763487g2w.

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

MLA Handbook (7th Edition):

Hauenstein, Jonathan David. “Regeneration, local dimension, and applications in numerical algebraic geometry</h1>.” 2009. Web. 23 Jan 2021.

Vancouver:

Hauenstein JD. Regeneration, local dimension, and applications in numerical algebraic geometry</h1>. [Internet] [Thesis]. University of Notre Dame; 2009. [cited 2021 Jan 23]. Available from: https://curate.nd.edu/show/w3763487g2w.

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

Council of Science Editors:

Hauenstein JD. Regeneration, local dimension, and applications in numerical algebraic geometry</h1>. [Thesis]. University of Notre Dame; 2009. Available from: https://curate.nd.edu/show/w3763487g2w

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


University of Lund

15. Ask, Erik. Methods for Optimal Model Fitting and Sensor Calibration.

Degree: 2014, University of Lund

 The problem of fitting models to measured data has been studied extensively, not least in the field of computer vision. A central problem in this… (more)

Subjects/Keywords: Mathematics; Computer Vision and Robotics (Autonomous Systems); Model Fitting; Sensor Networks; Computer Vision; Polynomial Equations; Action Matrix Methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ask, E. (2014). Methods for Optimal Model Fitting and Sensor Calibration. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/4628179 ; https://portal.research.lu.se/ws/files/3876001/4628235.pdf

Chicago Manual of Style (16th Edition):

Ask, Erik. “Methods for Optimal Model Fitting and Sensor Calibration.” 2014. Doctoral Dissertation, University of Lund. Accessed January 23, 2021. https://lup.lub.lu.se/record/4628179 ; https://portal.research.lu.se/ws/files/3876001/4628235.pdf.

MLA Handbook (7th Edition):

Ask, Erik. “Methods for Optimal Model Fitting and Sensor Calibration.” 2014. Web. 23 Jan 2021.

Vancouver:

Ask E. Methods for Optimal Model Fitting and Sensor Calibration. [Internet] [Doctoral dissertation]. University of Lund; 2014. [cited 2021 Jan 23]. Available from: https://lup.lub.lu.se/record/4628179 ; https://portal.research.lu.se/ws/files/3876001/4628235.pdf.

Council of Science Editors:

Ask E. Methods for Optimal Model Fitting and Sensor Calibration. [Doctoral Dissertation]. University of Lund; 2014. Available from: https://lup.lub.lu.se/record/4628179 ; https://portal.research.lu.se/ws/files/3876001/4628235.pdf


University of Lund

16. Kuang, Yubin. Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks.

Degree: 2014, University of Lund

 Given images of a scene taken by a moving camera or recordings of a moving smart phone playing a song by a microphone array, how… (more)

Subjects/Keywords: Computer Vision and Robotics (Autonomous Systems); Mathematics; polynomial solver; geometric problems; computer vision; sensor networks; symmetry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kuang, Y. (2014). Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/4393456 ; https://portal.research.lu.se/ws/files/5374142/4393481.pdf

Chicago Manual of Style (16th Edition):

Kuang, Yubin. “Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks.” 2014. Doctoral Dissertation, University of Lund. Accessed January 23, 2021. https://lup.lub.lu.se/record/4393456 ; https://portal.research.lu.se/ws/files/5374142/4393481.pdf.

MLA Handbook (7th Edition):

Kuang, Yubin. “Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks.” 2014. Web. 23 Jan 2021.

Vancouver:

Kuang Y. Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks. [Internet] [Doctoral dissertation]. University of Lund; 2014. [cited 2021 Jan 23]. Available from: https://lup.lub.lu.se/record/4393456 ; https://portal.research.lu.se/ws/files/5374142/4393481.pdf.

Council of Science Editors:

Kuang Y. Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks. [Doctoral Dissertation]. University of Lund; 2014. Available from: https://lup.lub.lu.se/record/4393456 ; https://portal.research.lu.se/ws/files/5374142/4393481.pdf


Universidad de Extremadura

17. García Zapata, Juan Luis. Métodos geométricos para aproximar raíces de polinomios, con aplicaciones a procesamiento de señal .

Degree: 2015, Universidad de Extremadura

 Los polinomios tienen una larga historia en matemáticas, ciencia e ingeniería. Es conocido que las raíces de polinomios de grado 2, 3 y 4 pueden… (more)

Subjects/Keywords: Aproximación numérica; Proceso lineal de señal; Análisis de algoritmos; Signal and systems; Polynomial models; Recursive algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

García Zapata, J. L. (2015). Métodos geométricos para aproximar raíces de polinomios, con aplicaciones a procesamiento de señal . (Thesis). Universidad de Extremadura. Retrieved from http://hdl.handle.net/10662/3658

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

García Zapata, Juan Luis. “Métodos geométricos para aproximar raíces de polinomios, con aplicaciones a procesamiento de señal .” 2015. Thesis, Universidad de Extremadura. Accessed January 23, 2021. http://hdl.handle.net/10662/3658.

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

MLA Handbook (7th Edition):

García Zapata, Juan Luis. “Métodos geométricos para aproximar raíces de polinomios, con aplicaciones a procesamiento de señal .” 2015. Web. 23 Jan 2021.

Vancouver:

García Zapata JL. Métodos geométricos para aproximar raíces de polinomios, con aplicaciones a procesamiento de señal . [Internet] [Thesis]. Universidad de Extremadura; 2015. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10662/3658.

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

Council of Science Editors:

García Zapata JL. Métodos geométricos para aproximar raíces de polinomios, con aplicaciones a procesamiento de señal . [Thesis]. Universidad de Extremadura; 2015. Available from: http://hdl.handle.net/10662/3658

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

18. El Hilany, Boulos. Géométrie tropicale et systèmes polynomiaux : Tropical geometry and polynomial systems.

Degree: Docteur es, Mathématiques, 2016, Université Grenoble Alpes (ComUE)

 Les systèmes polynomiaux réels sont omniprésents dans de nombreux domaines des mathématiques pures et appliquées. A. Khovanskii a fourni une borne fewnomiale supérieure sur le… (more)

Subjects/Keywords: Géométrie Algébrique Réelle; Théorie des Fewnomials; Géométrie Tropicale; Systèmes Polynomiaux; Real Algebraic Geometry; Theory of Fewnomials; Tropical Geometry; Polynomial Systems; 516

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

El Hilany, B. (2016). Géométrie tropicale et systèmes polynomiaux : Tropical geometry and polynomial systems. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2016GREAM037

Chicago Manual of Style (16th Edition):

El Hilany, Boulos. “Géométrie tropicale et systèmes polynomiaux : Tropical geometry and polynomial systems.” 2016. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed January 23, 2021. http://www.theses.fr/2016GREAM037.

MLA Handbook (7th Edition):

El Hilany, Boulos. “Géométrie tropicale et systèmes polynomiaux : Tropical geometry and polynomial systems.” 2016. Web. 23 Jan 2021.

Vancouver:

El Hilany B. Géométrie tropicale et systèmes polynomiaux : Tropical geometry and polynomial systems. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2016. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2016GREAM037.

Council of Science Editors:

El Hilany B. Géométrie tropicale et systèmes polynomiaux : Tropical geometry and polynomial systems. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2016. Available from: http://www.theses.fr/2016GREAM037


Virginia Tech

19. Oremland, Matthew Scott. Optimization and Optimal Control of Agent-Based Models.

Degree: MS, Mathematics, 2011, Virginia Tech

 Agent-based models are computer models made up of agents that can exist in a finite number of states. The state of the system at any… (more)

Subjects/Keywords: optimization; optimal control; individual-based model; polynomial dynamical system; agent-based model; bioinformatics; heuristic algorithm; discrete model; systems biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oremland, M. S. (2011). Optimization and Optimal Control of Agent-Based Models. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78119

Chicago Manual of Style (16th Edition):

Oremland, Matthew Scott. “Optimization and Optimal Control of Agent-Based Models.” 2011. Masters Thesis, Virginia Tech. Accessed January 23, 2021. http://hdl.handle.net/10919/78119.

MLA Handbook (7th Edition):

Oremland, Matthew Scott. “Optimization and Optimal Control of Agent-Based Models.” 2011. Web. 23 Jan 2021.

Vancouver:

Oremland MS. Optimization and Optimal Control of Agent-Based Models. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10919/78119.

Council of Science Editors:

Oremland MS. Optimization and Optimal Control of Agent-Based Models. [Masters Thesis]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/78119


Virginia Tech

20. Wise, Steven M. POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations.

Degree: MS, Mathematics, 1998, Virginia Tech

 Globally convergent, probability-one homotopy methods have proven to be very effective for finding all the isolated solutions to polynomial systems of equations. After many years… (more)

Subjects/Keywords: Numerical Analysis; Homotopy Methods; Polynomial Systems of Equations; Zeros

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wise, S. M. (1998). POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/36933

Chicago Manual of Style (16th Edition):

Wise, Steven M. “POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations.” 1998. Masters Thesis, Virginia Tech. Accessed January 23, 2021. http://hdl.handle.net/10919/36933.

MLA Handbook (7th Edition):

Wise, Steven M. “POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations.” 1998. Web. 23 Jan 2021.

Vancouver:

Wise SM. POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations. [Internet] [Masters thesis]. Virginia Tech; 1998. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10919/36933.

Council of Science Editors:

Wise SM. POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations. [Masters Thesis]. Virginia Tech; 1998. Available from: http://hdl.handle.net/10919/36933

21. Bender, Matias Rafael. Algorithms for sparse polynomial systems : Gröbner bases and resultants : Algorithmes pour les systèmes polynomiaux creux : bases de Gröbner et résultants.

Degree: Docteur es, Informatique, 2019, Sorbonne université

La résolution de systèmes polynomiaux est l’un des problèmes les plus anciens et importants en mathématiques informatiques et a des applications dans plusieurs domaines des… (more)

Subjects/Keywords: Résolution de systèmes polynomiaux; Systèmes polynomiaux creux; Systèmes multi-homogènes; Résultant; Base de Gröbner; Décomposition du tenseur; Solving polynomial systems; Sparse polynomial systems; Multi-homogenous systems; Resultant; Groebner base; Tensor decomposition; 004.0151

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bender, M. R. (2019). Algorithms for sparse polynomial systems : Gröbner bases and resultants : Algorithmes pour les systèmes polynomiaux creux : bases de Gröbner et résultants. (Doctoral Dissertation). Sorbonne université. Retrieved from http://www.theses.fr/2019SORUS029

Chicago Manual of Style (16th Edition):

Bender, Matias Rafael. “Algorithms for sparse polynomial systems : Gröbner bases and resultants : Algorithmes pour les systèmes polynomiaux creux : bases de Gröbner et résultants.” 2019. Doctoral Dissertation, Sorbonne université. Accessed January 23, 2021. http://www.theses.fr/2019SORUS029.

MLA Handbook (7th Edition):

Bender, Matias Rafael. “Algorithms for sparse polynomial systems : Gröbner bases and resultants : Algorithmes pour les systèmes polynomiaux creux : bases de Gröbner et résultants.” 2019. Web. 23 Jan 2021.

Vancouver:

Bender MR. Algorithms for sparse polynomial systems : Gröbner bases and resultants : Algorithmes pour les systèmes polynomiaux creux : bases de Gröbner et résultants. [Internet] [Doctoral dissertation]. Sorbonne université; 2019. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2019SORUS029.

Council of Science Editors:

Bender MR. Algorithms for sparse polynomial systems : Gröbner bases and resultants : Algorithmes pour les systèmes polynomiaux creux : bases de Gröbner et résultants. [Doctoral Dissertation]. Sorbonne université; 2019. Available from: http://www.theses.fr/2019SORUS029

22. Nechak, Lyes. Approches robustes du comportement dynamique des systèmes non linéaires : Application aux systèmes frottants : Robust approaches of dynamic behaviour of nonlinear systems : Application to friction systems.

Degree: Docteur es, Automatique et Mécanique, 2011, Mulhouse

Cette thèse traite de l’analyse robuste du comportement dynamique des systèmes frottants. Ces derniers constituent une classe particulière des systèmes non linéaires et sont caractérisés… (more)

Subjects/Keywords: Approches robustes; Chaos polynomial; Chaos multiéléments; Ondelettes de Haar; Systèmes dynamiques; Stabilité et cycle limites; Systèmes frottant; Incertitudes; Robust approaches; Polynomial chaos; Chaos multielements; Haar wavelet; Dynamic systems; Stability and limit cycle; Friction systems; Uncertainties

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nechak, L. (2011). Approches robustes du comportement dynamique des systèmes non linéaires : Application aux systèmes frottants : Robust approaches of dynamic behaviour of nonlinear systems : Application to friction systems. (Doctoral Dissertation). Mulhouse. Retrieved from http://www.theses.fr/2011MULH6253

Chicago Manual of Style (16th Edition):

Nechak, Lyes. “Approches robustes du comportement dynamique des systèmes non linéaires : Application aux systèmes frottants : Robust approaches of dynamic behaviour of nonlinear systems : Application to friction systems.” 2011. Doctoral Dissertation, Mulhouse. Accessed January 23, 2021. http://www.theses.fr/2011MULH6253.

MLA Handbook (7th Edition):

Nechak, Lyes. “Approches robustes du comportement dynamique des systèmes non linéaires : Application aux systèmes frottants : Robust approaches of dynamic behaviour of nonlinear systems : Application to friction systems.” 2011. Web. 23 Jan 2021.

Vancouver:

Nechak L. Approches robustes du comportement dynamique des systèmes non linéaires : Application aux systèmes frottants : Robust approaches of dynamic behaviour of nonlinear systems : Application to friction systems. [Internet] [Doctoral dissertation]. Mulhouse; 2011. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2011MULH6253.

Council of Science Editors:

Nechak L. Approches robustes du comportement dynamique des systèmes non linéaires : Application aux systèmes frottants : Robust approaches of dynamic behaviour of nonlinear systems : Application to friction systems. [Doctoral Dissertation]. Mulhouse; 2011. Available from: http://www.theses.fr/2011MULH6253


Virginia Tech

23. Dimitrova, Elena Stanimirova. Polynomial Models for Systems Biology: Data Discretization and Term Order Effect on Dynamics.

Degree: PhD, Mathematics, 2006, Virginia Tech

Systems biology aims at system-level understanding of biological systems, in particular cellular networks. The milestones of this understanding are knowledge of the structure of the… (more)

Subjects/Keywords: Biochemical Networks; Polynomial Rings; Polynomial Dynamical Systems; Gr\"{o}bner Bases; Systems Biology; Discrete Modeling; Data Discretization; Finite Fields

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dimitrova, E. S. (2006). Polynomial Models for Systems Biology: Data Discretization and Term Order Effect on Dynamics. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28490

Chicago Manual of Style (16th Edition):

Dimitrova, Elena Stanimirova. “Polynomial Models for Systems Biology: Data Discretization and Term Order Effect on Dynamics.” 2006. Doctoral Dissertation, Virginia Tech. Accessed January 23, 2021. http://hdl.handle.net/10919/28490.

MLA Handbook (7th Edition):

Dimitrova, Elena Stanimirova. “Polynomial Models for Systems Biology: Data Discretization and Term Order Effect on Dynamics.” 2006. Web. 23 Jan 2021.

Vancouver:

Dimitrova ES. Polynomial Models for Systems Biology: Data Discretization and Term Order Effect on Dynamics. [Internet] [Doctoral dissertation]. Virginia Tech; 2006. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/10919/28490.

Council of Science Editors:

Dimitrova ES. Polynomial Models for Systems Biology: Data Discretization and Term Order Effect on Dynamics. [Doctoral Dissertation]. Virginia Tech; 2006. Available from: http://hdl.handle.net/10919/28490


Université de Lorraine

24. Meddeb Mimouni, Houda. Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems.

Degree: Docteur es, Automatique, Traitement du signal et des images, Génie informatique, 2017, Université de Lorraine

Dans ce mémoire, nous avons proposé une nouvelle approche pour la stabilisation des polytopes de systèmes SISO LTI avec un contrôleur d’ordre fixe. En utilisant… (more)

Subjects/Keywords: Stabilisation simultanée; Segment de systèmes; Polytope de systèmes; Approche polynomiale; Optimisation linéaire; Simultaneous stabilization; Segment of systems; Polytope of systems; Polynomial approach; Linear optimization; 629.8; 620.001 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meddeb Mimouni, H. (2017). Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2017LORR0149

Chicago Manual of Style (16th Edition):

Meddeb Mimouni, Houda. “Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems.” 2017. Doctoral Dissertation, Université de Lorraine. Accessed January 23, 2021. http://www.theses.fr/2017LORR0149.

MLA Handbook (7th Edition):

Meddeb Mimouni, Houda. “Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems.” 2017. Web. 23 Jan 2021.

Vancouver:

Meddeb Mimouni H. Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems. [Internet] [Doctoral dissertation]. Université de Lorraine; 2017. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2017LORR0149.

Council of Science Editors:

Meddeb Mimouni H. Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems. [Doctoral Dissertation]. Université de Lorraine; 2017. Available from: http://www.theses.fr/2017LORR0149

25. Verron, Thibaut. Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale : Regularisation of Gröbner basis computations for weighted and determinantal systems, and application to medical imagery.

Degree: Docteur es, Informatique, 2016, Université Pierre et Marie Curie – Paris VI

La résolution de systèmes polynomiaux est un problème aux multiples applications, et les bases de Gröbner sont un outil important dans ce cadre. Il est… (more)

Subjects/Keywords: Systèmes polynomiaux; Bases de Gröbner; Systèmes structurés; Systèmes homogènes avec poids; Systèmes déterminantiels; Géométrie réelle; Polynomial systems; Gröbner bases; Structured systems; 518.1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Verron, T. (2016). Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale : Regularisation of Gröbner basis computations for weighted and determinantal systems, and application to medical imagery. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2016PA066355

Chicago Manual of Style (16th Edition):

Verron, Thibaut. “Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale : Regularisation of Gröbner basis computations for weighted and determinantal systems, and application to medical imagery.” 2016. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed January 23, 2021. http://www.theses.fr/2016PA066355.

MLA Handbook (7th Edition):

Verron, Thibaut. “Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale : Regularisation of Gröbner basis computations for weighted and determinantal systems, and application to medical imagery.” 2016. Web. 23 Jan 2021.

Vancouver:

Verron T. Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale : Regularisation of Gröbner basis computations for weighted and determinantal systems, and application to medical imagery. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2016PA066355.

Council of Science Editors:

Verron T. Régularisation du calcul de bases de Gröbner pour des systèmes avec poids et déterminantiels, et application en imagerie médicale : Regularisation of Gröbner basis computations for weighted and determinantal systems, and application to medical imagery. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. Available from: http://www.theses.fr/2016PA066355

26. Grenet, Bruno. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.

Degree: Docteur es, Informatique, 2012, Lyon, École normale supérieure

La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour résoudre un problème de manière algorithmique. Dans ce cadre,… (more)

Subjects/Keywords: Complexité algébrique; Déterminant; Permanent; Théorie de Valiant; Bornes inférieures; Corps finis; Test d'identité polynomiale; Factorisation; Circuits arithmétiques; Systèmes polynomiaux; Algebraic complexity; Determinant; Permanent; Valiant's theory; Lower bounds; Finite fields; Polynomial identity testing; Factorization; Arithmetic circuits; Polynomial systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grenet, B. (2012). Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2012ENSL0769

Chicago Manual of Style (16th Edition):

Grenet, Bruno. “Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.” 2012. Doctoral Dissertation, Lyon, École normale supérieure. Accessed January 23, 2021. http://www.theses.fr/2012ENSL0769.

MLA Handbook (7th Edition):

Grenet, Bruno. “Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.” 2012. Web. 23 Jan 2021.

Vancouver:

Grenet B. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2012. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2012ENSL0769.

Council of Science Editors:

Grenet B. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. [Doctoral Dissertation]. Lyon, École normale supérieure; 2012. Available from: http://www.theses.fr/2012ENSL0769


Indian Institute of Science

27. Devaraj, G. Schemes for Smooth Discretization And Inverse Problems - Case Study on Recovery of Tsunami Source Parameters.

Degree: PhD, Faculty of Engineering, 2017, Indian Institute of Science

 This thesis deals with smooth discretization schemes and inverse problems, the former used in efficient yet accurate numerical solutions to forward models required in turn… (more)

Subjects/Keywords: Smooth Discretization; Inverse Geodetic Problems; Strain Gradient Platicity Systems; Polynomial Reproducing Simplex Splines; Earthquake Source Parameters; Sumatra-Andaman Earthquake Source Parameters-2004; Tsunami Source Recovery; Tsunami Numerical Modeling; Polynomial Shape Functions; Mesh Free Method; Finite Element Method; Inverse Problems; Civil Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Devaraj, G. (2017). Schemes for Smooth Discretization And Inverse Problems - Case Study on Recovery of Tsunami Source Parameters. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2719

Chicago Manual of Style (16th Edition):

Devaraj, G. “Schemes for Smooth Discretization And Inverse Problems - Case Study on Recovery of Tsunami Source Parameters.” 2017. Doctoral Dissertation, Indian Institute of Science. Accessed January 23, 2021. http://etd.iisc.ac.in/handle/2005/2719.

MLA Handbook (7th Edition):

Devaraj, G. “Schemes for Smooth Discretization And Inverse Problems - Case Study on Recovery of Tsunami Source Parameters.” 2017. Web. 23 Jan 2021.

Vancouver:

Devaraj G. Schemes for Smooth Discretization And Inverse Problems - Case Study on Recovery of Tsunami Source Parameters. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2017. [cited 2021 Jan 23]. Available from: http://etd.iisc.ac.in/handle/2005/2719.

Council of Science Editors:

Devaraj G. Schemes for Smooth Discretization And Inverse Problems - Case Study on Recovery of Tsunami Source Parameters. [Doctoral Dissertation]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ac.in/handle/2005/2719

28. Masucci, Antonia Maria. Moments method for random matrices with applications to wireless communication. : La méthode des moments pour les matrices aléatoires avec application à la communication sans fil.

Degree: Docteur es, Télécommunications (STIC), 2011, Supélec

Dans cette thèse, on étudie l'application de la méthode des moments pour les télécommunications. On analyse cette méthode et on montre son importance pour l'étude… (more)

Subjects/Keywords: Méthode des moments; Matrices aléatoires; Probabilités libres; Systèmes MIMO; Réseaux cognitifs; Convolution/déconvolution; Détecteur à expansion polynomial; Réseaux linéaires uniformes; Moments method; Random matrices; Free probability; MIMO systems; Cognitive networks; Convolution/deconvolution; Polynomial expansion detector; Uniform linear arrays; 378.242

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Masucci, A. M. (2011). Moments method for random matrices with applications to wireless communication. : La méthode des moments pour les matrices aléatoires avec application à la communication sans fil. (Doctoral Dissertation). Supélec. Retrieved from http://www.theses.fr/2011SUPL0011

Chicago Manual of Style (16th Edition):

Masucci, Antonia Maria. “Moments method for random matrices with applications to wireless communication. : La méthode des moments pour les matrices aléatoires avec application à la communication sans fil.” 2011. Doctoral Dissertation, Supélec. Accessed January 23, 2021. http://www.theses.fr/2011SUPL0011.

MLA Handbook (7th Edition):

Masucci, Antonia Maria. “Moments method for random matrices with applications to wireless communication. : La méthode des moments pour les matrices aléatoires avec application à la communication sans fil.” 2011. Web. 23 Jan 2021.

Vancouver:

Masucci AM. Moments method for random matrices with applications to wireless communication. : La méthode des moments pour les matrices aléatoires avec application à la communication sans fil. [Internet] [Doctoral dissertation]. Supélec; 2011. [cited 2021 Jan 23]. Available from: http://www.theses.fr/2011SUPL0011.

Council of Science Editors:

Masucci AM. Moments method for random matrices with applications to wireless communication. : La méthode des moments pour les matrices aléatoires avec application à la communication sans fil. [Doctoral Dissertation]. Supélec; 2011. Available from: http://www.theses.fr/2011SUPL0011


University of Michigan

29. Lacy, Seth LaRoe. System identification.

Degree: PhD, Applied Sciences, 2002, University of Michigan

 In this dissertation, we present research on identifying Wiener systems with known, noninvertible nonlinearities; on identifying multi-input multi-output nonlinear systems that are linear in unmeasured… (more)

Subjects/Keywords: Multi-index Notation; Polynomial Nonlinearity; Subspace Identification; System Identification; Weiner Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lacy, S. L. (2002). System identification. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/129833

Chicago Manual of Style (16th Edition):

Lacy, Seth LaRoe. “System identification.” 2002. Doctoral Dissertation, University of Michigan. Accessed January 23, 2021. http://hdl.handle.net/2027.42/129833.

MLA Handbook (7th Edition):

Lacy, Seth LaRoe. “System identification.” 2002. Web. 23 Jan 2021.

Vancouver:

Lacy SL. System identification. [Internet] [Doctoral dissertation]. University of Michigan; 2002. [cited 2021 Jan 23]. Available from: http://hdl.handle.net/2027.42/129833.

Council of Science Editors:

Lacy SL. System identification. [Doctoral Dissertation]. University of Michigan; 2002. Available from: http://hdl.handle.net/2027.42/129833


North Carolina State University

30. Teachey, Angela Lynne. Investigations in Conceptual Understanding of Polynomial Functions and the Impact of Mathematical Belief Systems on Achievement in an Accelerated Summer Program for Gifted Students.

Degree: PhD, Mathematics Education, 2003, North Carolina State University

 This study investigated the achievement of gifted students on mathematics problems that were designed to assess both conceptual and procedural knowledge of polynomial functions, and… (more)

Subjects/Keywords: polynomial functions; conceptual understanding; mathematical belief systems; gifted education; mathematics education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Teachey, A. L. (2003). Investigations in Conceptual Understanding of Polynomial Functions and the Impact of Mathematical Belief Systems on Achievement in an Accelerated Summer Program for Gifted Students. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4836

Chicago Manual of Style (16th Edition):

Teachey, Angela Lynne. “Investigations in Conceptual Understanding of Polynomial Functions and the Impact of Mathematical Belief Systems on Achievement in an Accelerated Summer Program for Gifted Students.” 2003. Doctoral Dissertation, North Carolina State University. Accessed January 23, 2021. http://www.lib.ncsu.edu/resolver/1840.16/4836.

MLA Handbook (7th Edition):

Teachey, Angela Lynne. “Investigations in Conceptual Understanding of Polynomial Functions and the Impact of Mathematical Belief Systems on Achievement in an Accelerated Summer Program for Gifted Students.” 2003. Web. 23 Jan 2021.

Vancouver:

Teachey AL. Investigations in Conceptual Understanding of Polynomial Functions and the Impact of Mathematical Belief Systems on Achievement in an Accelerated Summer Program for Gifted Students. [Internet] [Doctoral dissertation]. North Carolina State University; 2003. [cited 2021 Jan 23]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4836.

Council of Science Editors:

Teachey AL. Investigations in Conceptual Understanding of Polynomial Functions and the Impact of Mathematical Belief Systems on Achievement in an Accelerated Summer Program for Gifted Students. [Doctoral Dissertation]. North Carolina State University; 2003. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4836

[1] [2] [3]

.