Literatura académica sobre el tema "Decomposition (Mathematics)"

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Decomposition (Mathematics)".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Decomposition (Mathematics)"

1

Crâşmăreanu, Mircea. "Particular trace decompositions and applications of trace decomposition to almost projective invariants." Mathematica Bohemica 126, no. 3 (2001): 631–37. http://dx.doi.org/10.21136/mb.2001.134205.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

ĐOKOVIĆ, DRAGOMIR Ž., and KAIMING ZHAO. "RATIONAL JORDAN DECOMPOSITION OF BILINEAR FORMS." Communications in Contemporary Mathematics 07, no. 06 (December 2005): 769–86. http://dx.doi.org/10.1142/s0219199705001945.

Texto completo
Resumen
This is a continuation of our previous work on Jordan decomposition of bilinear forms over algebraically closed fields of characteristic 0. In this note, we study Jordan decomposition of bilinear forms over any field K0 of characteristic 0. Let V0 be an n-dimensional vector space over K0. Denote by [Formula: see text] the space of bilinear forms f : V0 × V0 → K0. We say that f = g + h, where f, g, [Formula: see text], is a rational Jordan decomposition of f if, after extending the field K0 to an algebraic closure K, we obtain a Jordan decomposition over K. By using the Galois group of K/K0, we
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Fontanil, Lauro, and Eduardo Mendoza. "Common complexes of decompositions and complex balanced equilibria of chemical reaction networks." MATCH Communications in Mathematical and in Computer Chemistry 87, no. 2 (2021): 329–66. http://dx.doi.org/10.46793/match.87-2.329f.

Texto completo
Resumen
A decomposition of a chemical reaction network (CRN) is produced by partitioning its set of reactions. The partition induces networks, called subnetworks, that are "smaller" than the given CRN which, at this point, can be called parent network. A complex is called a common complex if it occurs in at least two subnetworks in a decomposition. A decomposition is said to be incidence independent if the image of the incidence map of the parent network is the direct sum of the images of the subnetworks' incidence maps. It has been recently discovered that the complex balanced equilibria of the paren
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Diestel, Reinhard. "Simplicial minors and decompositions of graphs." Mathematical Proceedings of the Cambridge Philosophical Society 103, no. 3 (May 1988): 409–26. http://dx.doi.org/10.1017/s0305004100065026.

Texto completo
Resumen
The purpose of this paper is to give natural characterizations of the countable graphs that admit tree-decompositions or simplicial tree-decompositions into primes. Tree-decompositions were recently introduced by Robertson and Seymour in their series of papers on graph minors [7]. Simplicial tree-decompositions were first considered by Halin[6], being the most typical kind of ‘simplicial decomposition’ as introduced by Halin[5] in 1964. The problem of determining which infinite graphs admit a simplicial decomposition into primes has stood unresolved since then; a first solution for simplicial
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

AVGUSTINOVICH, S. V., and A. E. FRID. "A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES." International Journal of Algebra and Computation 15, no. 01 (February 2005): 149–60. http://dx.doi.org/10.1142/s0218196705002116.

Texto completo
Resumen
We study decompositions of a factorial language to catenations of factorial languages and introduce the notion of a canonical decomposition. Then we prove that for each factorial language, a canonical decomposition exists and is unique.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Breiding, Paul, and Nick Vannieuwenhoven. "On the average condition number of tensor rank decompositions." IMA Journal of Numerical Analysis 40, no. 3 (June 20, 2019): 1908–36. http://dx.doi.org/10.1093/imanum/drz026.

Texto completo
Resumen
Abstract We compute the expected value of powers of the geometric condition number of random tensor rank decompositions. It is shown in particular that the expected value of the condition number of $n_1\times n_2 \times 2$ tensors with a random rank-$r$ decomposition, given by factor matrices with independent and identically distributed standard normal entries, is infinite. This entails that it is expected and probable that such a rank-$r$ decomposition is sensitive to perturbations of the tensor. Moreover, it provides concrete further evidence that tensor decomposition can be a challenging pr
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Broer, Abraham. "Decomposition Varieties in Semisimple Lie Algebras." Canadian Journal of Mathematics 50, no. 5 (October 1, 1998): 929–71. http://dx.doi.org/10.4153/cjm-1998-048-6.

Texto completo
Resumen
AbstractThe notion of decompositon class in a semisimple Lie algebra is a common generalization of nilpotent orbits and the set of regular semisimple elements.We prove that the closure of a decomposition class has many properties in common with nilpotent varieties, e.g., its normalization has rational singularities.The famous Grothendieck simultaneous resolution is related to the decomposition class of regular semisimple elements. We study the properties of the analogous commutative diagrams associated to an arbitrary decomposition class.
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

FOULIS, DAVID J., SYLVIA PULMANNOVÁ, and ELENA VINCEKOVÁ. "TYPE DECOMPOSITION OF A PSEUDOEFFECT ALGEBRA." Journal of the Australian Mathematical Society 89, no. 3 (December 2010): 335–58. http://dx.doi.org/10.1017/s1446788711001042.

Texto completo
Resumen
AbstractEffect algebras, which generalize the lattice of projections in a von Neumann algebra, serve as a basis for the study of unsharp observables in quantum mechanics. The direct decomposition of a von Neumann algebra into types I, II, and III is reflected by a corresponding decomposition of its lattice of projections, and vice versa. More generally, in a centrally orthocomplete effect algebra, the so-called type-determining sets induce direct decompositions into various types. In this paper, we extend the theory of type decomposition to a (possibly) noncommutative version of an effect alge
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Theriault, Stephen D. "Homotopy Decompositions Involving the Loops of Coassociative Co-H Spaces." Canadian Journal of Mathematics 55, no. 1 (February 1, 2003): 181–203. http://dx.doi.org/10.4153/cjm-2003-008-5.

Texto completo
Resumen
AbstractJames gave an integral homotopy decomposition of ∑Ω∑X, Hilton-Milnor one for Ω(∑X ∨ ∑Y), and Cohen-Wu gave p-local decompositions of Ω∑X if X is a suspension. All are natural. Using idempotents and telescopes we show that the James andHilton-Milnor decompositions have analogues when the suspensions are replaced by coassociative co-H spaces, and the Cohen-Wu decomposition has an analogue when the (double) suspension is replaced by a coassociative, cocommutative co-H space.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

GUTIERREZ, MAURICIO, and ADAM PIGGOTT. "RIGIDITY OF GRAPH PRODUCTS OF ABELIAN GROUPS." Bulletin of the Australian Mathematical Society 77, no. 2 (April 2008): 187–96. http://dx.doi.org/10.1017/s0004972708000105.

Texto completo
Resumen
AbstractWe show that if G is a group and G has a graph-product decomposition with finitely generated abelian vertex groups, then G has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex group is a directly indecomposable cyclic group, and a unique decomposition in which each vertex group is a finitely generated abelian group and the graph satisfies the T0 property. Our results build on results by Droms, Laurence and Radcliffe.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Tesis sobre el tema "Decomposition (Mathematics)"

1

Burns, Brenda D. "The Staircase Decomposition for Reductive Monoids." NCSU, 2002. http://www.lib.ncsu.edu/theses/available/etd-20020422-102254.

Texto completo
Resumen
<p>Burns, Brenda Darlene. The Staircase Decomposition for Reductive Monoids. (Under the direction of Mohan Putcha.) The purpose of the research has been to develop a decomposition for the J-classes of a reductive monoid. The reductive monoid M(K) isconsidered first. A J-class in M(K) consists ofelements of the same rank. Lower and upper staircase matricesare defined and used to decompose a matrix x of rank r into theproduct of a lower staircase matrix, a matrix with a rank rpermutation matrix in the upper left hand corner, and an upperstaircase matrix, each of which is of rank r. The choice of
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Kwizera, Petero. "Matrix Singular Value Decomposition." UNF Digital Commons, 2010. http://digitalcommons.unf.edu/etd/381.

Texto completo
Resumen
This thesis starts with the fundamentals of matrix theory and ends with applications of the matrix singular value decomposition (SVD). The background matrix theory coverage includes unitary and Hermitian matrices, and matrix norms and how they relate to matrix SVD. The matrix condition number is discussed in relationship to the solution of linear equations. Some inequalities based on the trace of a matrix, polar matrix decomposition, unitaries and partial isometies are discussed. Among the SVD applications discussed are the method of least squares and image compression. Expansion of a matrix a
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Ngulo, Uledi. "Decomposition Methods for Combinatorial Optimization." Licentiate thesis, Linköpings universitet, Tillämpad matematik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-175896.

Texto completo
Resumen
This thesis aims at research in the field of combinatorial optimization. Problems within this field often posses special structures allowing them to be decomposed into more easily solved subproblems, which can be exploited in solution methods. These structures appear frequently in applications. We contribute with both re-search on the development of decomposition principles and on applications. The thesis consists of an introduction and three papers.  In Paper I, we develop a Lagrangian meta-heuristic principle, which is founded on a primal-dual global optimality condition for discrete and non
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Hersh, Patricia (Patricia Lynn) 1973. "Decomposition and enumeration in partially ordered sets." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/85303.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Samuelsson, Saga. "The Singular Value Decomposition Theorem." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-150917.

Texto completo
Resumen
This essay will present a self-contained exposition of the singular value decomposition theorem for linear transformations. An immediate consequence is the singular value decomposition for complex matrices.<br>Denna uppsats kommer presentera en självständig exposition av singulärvärdesuppdelningssatsen för linjära transformationer. En direkt följd är singulärvärdesuppdelning för komplexa matriser.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Simeone, Daniel. "Network connectivity: a tree decomposition approach." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18797.

Texto completo
Resumen
We show that the gap between the least costly 3-edge-connected metric graph and the least costly 3-vertex-connected metric graph is at most $3$. The approach relies upon tree decompositions, and a degree limiting theorem of Bienstock et al. As well, we explore the tree decomposition approach for general k-edge and vertex-connected graphs, and demonstrate a large amount of the required background theory.<br>Nous démontrons que l'écart entre un graphe métrique 3-arête-connexe de coût minimum et un graphe métrique 3-sommet-connexe de coût minimum est au plus 3. Notre approche repose sur l'existen
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Riaz, Samia. "Domain decomposition method for variational inequalities." Thesis, University of Birmingham, 2014. http://etheses.bham.ac.uk//id/eprint/4815/.

Texto completo
Resumen
Variational inequalities have found many applications in applied science. A partial list includes obstacles problems, fluid flow in porous media, management science, traffic network, and financial equilibrium problems. However, solving variational inequalities remain a challenging task as they are often subject to some set of complex constraints, for example the obstacle problem. Domain decomposition methods provide great flexibility to handle these types of problems. In our thesis we consider a general variational inequality, its finite element formulation and its equivalence with linear and
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Korey, Michael Brian. "A decomposition of functions with vanishing mean oscillation." Universität Potsdam, 2001. http://opus.kobv.de/ubp/volltexte/2008/2592/.

Texto completo
Resumen
A function has vanishing mean oscillation (VMO) on R up(n) if its mean oscillation - the local average of its pointwise deviation from its mean value - both is uniformly bounded over all cubes within R up(n) and converges to zero with the volume of the cube. The more restrictive class of functions with vanishing lower oscillation (VLO) arises when the mean value is replaced by the minimum value in this definition. It is shown here that each VMO function is the difference of two functions in VLO.
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Wilson, Michelle Marie Lucy. "A survey of primary decomposition using Gröbner bases." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/37005.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Jung, Kyomin. "Approximate inference : decomposition methods with applications to networks." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/50595.

Texto completo
Resumen
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2009.<br>Includes bibliographical references (p. 147-151).<br>Markov random field (MRF) model provides an elegant probabilistic framework to formulate inter-dependency between a large number of random variables. In this thesis, we present a new approximation algorithm for computing Maximum a Posteriori (MAP) and the log-partition function for arbitrary positive pair-wise MRF defined on a graph G. Our algorithm is based on decomposition of G into appropriately chosen small components; then computing estimates locally
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Libros sobre el tema "Decomposition (Mathematics)"

1

Truemper, K. Matroid decomposition. 2nd ed. [Berlin, Germany]: ELibM [EMIS, EMS], 2000.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Moody, R. V. Lie algebras with triangular decompositions. New York: Wiley, 1995.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Adomian, G. Solving frontier problems of physics: The decomposition methoc [i.e. method]. Dordrecht: Kluwer Academic Publishers, 1994.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Milman, Mario. Extrapolation and optimal decompositions: With applications to analysis. Berlin: Springer-Verlag, 1994.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

N, Pavlovskiĭ I͡U︡, and Akademii͡a︡ nauk SSSR. Vychislitelʹnyĭ t͡s︡entr., eds. Dekompozit͡s︡ii͡a︡ i optimizat͡s︡ii͡a︡ v slozhnykh sistemakh. Moskva: Vychislitelʹnyĭ t͡s︡entr AN SSSR, 1991.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Pavlovskiĭ, I͡U N. Dekompozit͡sii͡a i optimizat͡sii͡a v slozhnykh sistemakh. Moskva: Vychislitelʹnyĭ t͡sentr AN SSSR, 1991.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Conejo, Antonio J. Decomposition techniques in mathematical programming: Engineering and science applications. Berlin: Springer, 2010.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Pavlovskiĭ, I︠U︡ N. Geometricheskai︠a︡ teorii︠a︡ dekompozit︠s︡ii i nekotorye ee prilozhenii︠a︡. Moskva: Vychislitelʹnyĭ t︠s︡entr im. A.A. Dorodnit︠s︡yna Rossiĭskoĭ akademii nauk, 2011.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Daverman, Robert J. Decompositions of manifolds. Providence, R.I: American Mathematical Society, 2007.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Ho, James K. K. DECOMP: An implementation of Dantzig-Wolfe decomposition for linear programming. New York: Springer-Verlag, 1989.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Capítulos de libros sobre el tema "Decomposition (Mathematics)"

1

Méndez, Miguel A. "Decomposition Theory." In SpringerBriefs in Mathematics, 63–94. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-11713-3_4.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Macías, Sergio. "Decomposition Theorems." In Developments in Mathematics, 95–122. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65081-0_3.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Pilgrim, Kevin M. "5 Decomposition." In Lecture Notes in Mathematics, 69–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39936-0_5.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Lorentz, Rudolph A. "Decomposition theorems." In Lecture Notes in Mathematics, 62–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0088794.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Bruns, Winfried, and Udo Vetter. "Primary decomposition." In Lecture Notes in Mathematics, 122–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0080388.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Fujiwara, Hidenori, and Jean Ludwig. "Irreducible Decomposition." In Springer Monographs in Mathematics, 289–315. Tokyo: Springer Japan, 2014. http://dx.doi.org/10.1007/978-4-431-55288-8_8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Jorgenson, Jay, and Serge Lang. "Polar Decomposition." In Springer Monographs in Mathematics, 219–54. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4684-9302-3_6.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Hilgert, Joachim, and Karl-Hermann Neeb. "Root Decomposition." In Springer Monographs in Mathematics, 133–66. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-0-387-84794-8_6.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Blyth, T. S., and E. F. Robertson. "Primary Decomposition." In Springer Undergraduate Mathematics Series, 37–46. London: Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-0661-6_4.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Landsberg, J. "Tensor decomposition." In Graduate Studies in Mathematics, 289–310. Providence, Rhode Island: American Mathematical Society, 2011. http://dx.doi.org/10.1090/gsm/128/12.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Actas de conferencias sobre el tema "Decomposition (Mathematics)"

1

Divanyan, Letisya, Metin Demiralp, Theodore E. Simos, George Psihoyios, Ch Tsitouras, and Zacharias Anastassi. "Weighted Reductive Multilinear Array Decomposition." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: International Conference on Numerical Analysis and Applied Mathematics. AIP, 2011. http://dx.doi.org/10.1063/1.3637820.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Fuad, Amirul Aizad Ahmad, and Tahir Ahmad. "The decomposition of electroencephalography signals during epileptic seizure." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136478.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Gündoğar, Zeynep, N. A. Baykara, Metin Demiralp, Theodore E. Simos, George Psihoyios, Ch Tsitouras, and Zacharias Anastassi. "Derivative Including Quadratures Based on Kernel Decomposition." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: International Conference on Numerical Analysis and Applied Mathematics. AIP, 2011. http://dx.doi.org/10.1063/1.3637825.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Awajan, Ahmad M., Mohd Tahir Ismail, and S. AL Wadi. "Stock market forecasting using empirical mode decomposition with holt-winter." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136394.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Rahman, Norazrizal Aswad Abdul. "Fuzzy Sumudu decomposition method for solving differential equations with uncertainty." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136474.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Biazar, Jafar, Zainab Ayati, and Hamideh Ebrahimi. "Comparing Homotopy Perturbation Method and Adomian Decomposition Method." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2008. American Institute of Physics, 2008. http://dx.doi.org/10.1063/1.2991054.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Egidi, Nadaniela. "Taylor expansion for RBFs decomposition." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: ICNAAM2022. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0212718.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Giacomini, Josephin. "RBFs preconditioning via Fourier decomposition method." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: ICNAAM2022. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0212993.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Berninger, Heiko, Ralf Kornhuber, Oliver Sander, Theodore E. Simos, George Psihoyios, Ch Tsitouras, and Zacharias Anastassi. "Heterogeneous Domain Decomposition of Surface and Porous Media Flow." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: International Conference on Numerical Analysis and Applied Mathematics. AIP, 2011. http://dx.doi.org/10.1063/1.3637013.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Demiralp, Metin, Emre Demiralp, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "An Orthonormal Decomposition Method for Multidimensional Matrices." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2009: Volume 1 and Volume 2. AIP, 2009. http://dx.doi.org/10.1063/1.3241487.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Informes sobre el tema "Decomposition (Mathematics)"

1

Davis, Wayne, and Albert Jones. Mathematical decomposition and simulation in real-time production scheduling. Gaithersburg, MD: error:, January 1987. http://dx.doi.org/10.6028/nbs.ir.87-3639.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Salloum, Maher N., and Patricia E. Gharagozloo. Empirical and physics based mathematical models of uranium hydride decomposition kinetics with quantified uncertainties. Office of Scientific and Technical Information (OSTI), October 2013. http://dx.doi.org/10.2172/1115318.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!