Skip to main content

PROBLEMAS MATRICIALES: COMPUTACION, TEORIA Y APLICACIONES

MTM2017-85669-P

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2017
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 24
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Block hybrid multilevel method to compute the dominant lambda-modes of the neutron diffusion equation

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The dominant lambda-modes associated with a nuclear reactor configuration describe the neutron steady-state distribution and its criticality. Furthermore, they are useful to develop modal methods to study reactor instabilities. Different eigenvalues solvers have been successfully used to obtain such modes, most of them are implemented reducing the original generalized eigenvalue problem to an ordinary one. Thus, it is necessary to solve many linear systems making these methods not very efficient, especially for large problems. In this work, the original generalized eigenvalue problem is considered and two block iterative methods to solve it are studied: the block inverse-free preconditioned Arnoldi method and the modified block Newton method. All of these iterative solvers are initialized using a block multilevel technique. A hybrid multilevel method is also proposed based on the combination of the methods proposed. Two benchmark problems are studied illustrating the convergence and the competitiveness of the methods proposed. A comparison with the Krylov-Schur method and the Generalized Davidson is also included., This work has been partially supported by Spanish Ministerio de Economia y Competitividad under projects ENE2017-89029-P, MTM2017-85669-P and BES-2015-072901.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On totally nonpositive matrices associated with a triple negatively realizable

  • Cantó Colomina, Begoña|||0000-0002-9837-3926
  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[EN] Let A is an element of R-nxn be a totally nonpositive matrix (t.n.p.) with rank r and principal rank p, that is, every minor of A is nonpositive and p is the size of the largest invertible principal submatrix of A. We introduce that a triple (n, r, p) will be called negatively realizable if there exists a t.n.p. matrix A of order n and such that its rank is r and its principal rank is p. In this work we extend the results obtained for irreducible totally nonnegative matrices given in Canto and Urbano (Linear Algebra Appl 551:125-146. https://doi.org/10.1016/j.laa.2018.03.045, 2018) to t.n.p. matrices. For that, we consider the sequence of the first p-indices of A and study the linear dependence relations between their rows and columns. These relations allow us to construct t.n.p. matrices associated with a triple (n, r, p) negatively realizable and a specific sequence of the first p-indices., This research was supported by the Ministerio de Economía y Competividad under the Spanish DGI Grant MTM2017-85669-P-AR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Adaptive time-step control for modal methods to integrate the neutron diffusion equation

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The solution of the time-dependent neutron diffusion equation can be approximated using quasi-static methods that factorise the neutronic flux as the product of a time dependent function times a shape function that depends both on space and time. A generalization of this technique is the updated modal method. This strategy assumes that the neutron flux can be decomposed into a sum of amplitudes multiplied by some shape functions. These functions, known as modes, come from the solution of the eigenvalue problems associated with the static neutron diffusion equation that are being updated along the transient. In previous works, the time step used to update the modes is set to a fixed value and this implies the need of using small time-steps to obtain accurate results and, consequently, a high computational cost. In this work, we propose the use of an adaptive control time-step that reduces automatically the time-step when the algorithm detects large errors and increases this value when it is not necessary to use small steps. Several strategies to compute the modes updating time step are proposed and their performance is tested for different transients in benchmark reactors with rectangular and hexagonal geometry., This work has been partially supported by Spanish Ministerio de Economia y Competitividad under projects ENE2017-89029-P and MTM2017-85669-P and financed with the help of a Primeros Proyectos de Investigacion (PAID-06-18) from Vicerrectorado de Investigacion, Innovacion y Transferencia of the Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Combined matrices and conditioning

  • Bru García, Rafael
  • Gasso Matoses, María Teresa
  • Santana-De Asis, Máximo De Jesús
[EN] In this work, we study a lower bound of the condition number of a matrix by its combined matrix. In particular, we construct a special combined matrix in such a way that the sums of its columns are lower bounds of the condition number of the matrix. Cases for special matrices as unitary matrices are considered., We thank the anonymous referees for their valuable reports that have improved this work. This work was partially sup-ported by Spanish grants MTM2017-85669-P and MTM2017-90682-REDT from "Ministerio de Economa y Competitividad", and by the Dominican Republic FONDOCYT grant number 2016-2017-057.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Compact quasi-Newton preconditioners for symmetric positive definite linear systems

  • BERGAMASCHI, LUCA
  • MARTINEZ, ANGELES
  • Marín Mateos-Aparicio, José|||0000-0002-7825-2836
[EN] In this paper, preconditioners for the conjugate gradient method are studied to solve the Newton system with symmetric positive definite Jacobian. In particular, we define a sequence of preconditioners built by means of Symmetric Rank one (SR1) and Broyden-Fletcher-Goldfarb-Shanno (BFGS) low-rank updates. We develop conditions under which the SR1 update maintains the preconditioner symmetric positive definite. Spectral analysis of the SR1 preconditioned Jacobians shows an improved eigenvalue distribution as the Newton iteration proceeds. A compact matrix formulation of the preconditioner update is developed which reduces the cost of its application and is more suitable to parallel implementation. Some notes on the implementation of the corresponding Inexact Newton method are given and some numerical results on a number of model problems illustrate the efficiency of the proposed preconditioners., This work was supported by the Spanish Ministerio de Economia y Competitividad under grants MTM2014-58159-P, MTM2017-85669-P, and MTM2017-90682-REDT. The first and third authors have been also partially supported by the INdAM Research group GNCS, 2020 Project: Optimization and advanced linear algebra for problems arising from PDEs.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Block Preconditioning Matrices for the Newton Method to Compute the Dominant lambda-Modes Associated with the Neutron Diffusion Equation

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
  • Bergamaschi, Luca
  • Martinez, Angeles
[EN] In nuclear engineering, the lambda-modes associated with the neutron diffusion equation are applied to study the criticality of reactors and to develop modal methods for the transient analysis. The differential eigenvalue problem that needs to be solved is discretized using a finite element method, obtaining a generalized algebraic eigenvalue problem whose associated matrices are large and sparse. Then, efficient methods are needed to solve this problem. In this work, we used a block generalized Newton method implemented with a matrix-free technique that does not store all matrices explicitly. This technique reduces mainly the computational memory and, in some cases, when the assembly of the matrices is an expensive task, the computational time. The main problem is that the block Newton method requires solving linear systems, which need to be preconditioned. The construction of preconditioners such as ILU or ICC based on a fully-assembled matrix is not efficient in terms of the memory with the matrix-free implementation. As an alternative, several block preconditioners are studied that only save a few block matrices in comparison with the full problem. To test the performance of these methodologies, different reactor problems are studied., This work has been partially supported by the Spanish Ministerio de Economia y Competitividad under Projects ENE2014-59442-P, MTM2014-58159-P, and BES-2015-072901.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Frequency-domain models in the SPN approximation for neutron noise calculations

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] Simulations of the neutron flux fluctuations, known as neutron noise, can be performed by means of the spherical harmonics equations (SPN) approximation with higher accuracy than with the diffusion equation. In this sense, one can solve these equations in the time-domain or in the frequency-domain. This last approach permits solving the neutron noise without performing complete time-dependent simulations for monochromatic perturbations. This work presents two formulations of the SPN equations in the frequency domain, that are obtained by using different treatments of the time derivatives of the field moments. The methodology is verified with several neutron noise problems where the numerical results are compared with the time-domain computations of FEMFFUSION code. The C5G7 noise benchmark compares both SPN formulations, showing the applicability of the diffusive SPN approximation., This work has been partially supported by Spanish Ministerio de Economía y Competitividad under projects ENE2017-89029-P and MTM2017-85669-P. Furthermore, this work has been financed by the Generalitat Valenciana under the project PROMETEO/2018/035.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Strategies of Preconditioner Updates for Sequences of Linear Systems Associated with the Neutron Diffusion

  • Carreño, Amanda|||0000-0003-2302-1157
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
  • Bergamaschi, L.
  • Martínez, A.
[EN] The time-dependent neutron diffusion equation approximates the neutronic power evolution inside a nuclear reactor core. Applying a Galerkin finite element method for the spatial discretization of these equations leads to a stiff semi-discrete system of ordinary differential equations. For time discretization, an implicit scheme is used, which implies solving a large and sparse linear system of equations for each time step. The GMRES method is used to solve these systems because of its fast convergence when a suitable preconditioner is provided. This work explores several matrix-free strategies based on different updated preconditioners, which are constructed by low-rank updates of a given initial preconditioner. They are two tuned preconditioners based on the bad and good Broyden¿s methods, initially developed for nonlinear equations and optimization problems, and spectral preconditioners. The efficiency of the resulting preconditioners under study is closely related to the selection of the subspace used to construct the update. Our numerical results show the effectiveness of these methodologies in terms of CPU time and storage for different nuclear benchmark transients, even if the initial preconditioner is not good enough., This work has been partially supported by Spanish Ministerio de Economia y Competitividad under projects ENE2017-89029-P and MTM2017-85669-P. The second and third authors have been supported by the INdAM Research group GNCS project: Optimization and Advanced Linear Algebra for Problems Governed by PDEs. Furthermore, this work has been financed by the Generalitat Valenciana under the project PROMETEO/2018/035. We sincerely thank the three anonymous reviewers for helping us to significantly improve the manuscript.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

A method to construct irreducible totally nonnegative matrices with a given Jordan canonical form

  • Cantó Colomina, Begoña|||0000-0002-9837-3926
  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[EN] Let A¿Rn×n be an irreducible totally nonnegative matrix (ITN), that is, A is irreducible with all its minors nonnegative. A triple (n,r,p) is called realizable if there exists an ITN matrix A¿Rn×n with rank(A)=r and p-rank(A)=p (recall that p-rank(A) is the size of the largest invertible principal submatrix of A). Each ITN matrix associated with a realizable triple (n,r,p) has positive and distinct eigenvalues, and for the zero eigenvalue it is verified that n¿r and n¿p are the geometric and the algebraic multiplicity, respectively. Moreover, since rank(A)=r, has n¿r zero Jordan blocks whose sizes are given by the Segre characteristic, S= (s1, s2,.. . , s_n-r ), with s_i¿ p, i = 1, 2, . . . , n¿r. We know the number of zero Jordan canonical forms of ITN matrices associated with a realizable triple (n,r,p) and all these zero Jordan canonical forms. The following important question that we present in this talk deals with how to construct an ITN matrix associated with (n,r,p) and exactly with one of these Segre characteristic S corresponding to the zero eigenvalue., This work has been supported by the Ministerio de Economía y Competitividad under the Spanish DGI grant MTM2017-85669-P-AR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Adaptive time-step control for the modal method to integrate the multigroup neutron diffusion equation

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The distribution of the power inside a reactor core can be described by the time dependent multigroup neutron diffusion equation. One of the approaches to integrate this time-dependent equation is the modal method, that assumes that the solution can be described by the sum of amplitude function multiplied by shape functions of modes. These shape functions can be computed by solving a _-modes problems. The modal method has a great interest when the distribution of the power cannot be well approximated by only one shape function, mainly, when local perturbations are applied during the transient. Usually, the shape functions of the modal methods are updated for the time-dependent equations with a constant time-step size to obtain accurate results. In this work, we propose a modal methodology with an adaptive control time-step to update the eigenfunctions associated with the modes. This algorithm improves efficiency because of time is not spent solving the systems to a level of accuracy beyond relevance and reduces the step size if they detect a numerical instability. Step size controllers require an error estimation. Different error estimations are considered and analyzed in a benchmark problem with a out of phase local perturbation., This work has been partially supported by Spanish Ministerio de Economía y Competitividad under projects ENE2017-89029-P, MTM2017-85669-P and BES-2015-072901
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Block strategies to compute the lambda modes associated with the neutron diffusion equation

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] Given a configuration of a nuclear reactor core, the neutronic distribution of the power can beapproximated by means of the multigroup neutron diffusion equation. This is an approximationof the neutron transport equation that assumes that the neutron current is proportional to thegradient of the scalar neutron ux with a diffusion coeffcient [1]. This approximation is known asthe Fick's first law. To define the steady-state problem, the criticality of the system must be forced.In this work, the -modes problem is used. That yields a generalized eigenvalue problem whoseeigenvector associated with the dominant eigenvalue represents the distribution of the neutron uxin steady-state.The spatial discretization of the equation is made by a continuous Galerkin high order finite elementmethod is applied [2] to obtain an algebraic eigenvalue problem. Usually, the matrices obtainedfrom the discretization are huge and sparse. Moreover, they have a block structure given by the different number of energy groups. In this work, block strategies are developed to optimize thecomputation of the associated eigenvalue problems.First, different block eigenvalue solvers are studied. On the other hand, the convergence of theseiterative methods mainly depends on the initial guess and the preconditioner used. In this sense,different multilevel techniques to accelerate the rate of convergence are proposed. Finally, the sizeof the problems can be suffciently large to be unfeasible to be solved in personal computers. Thus,a matrix-free methodology that avoids the allocation of the matrices in memory is applied [3].Three-dimensional benchmarks are used to show the effciency of the methodology proposed., This work has been partially supported by Spanish Ministerio de Economía y Competitividad under projects ENE2017-89029-P and MTM2017-85669-P. Furthermore, this work has been financed by the Generalitat Valenciana under the project PROMETEO/2018/035.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Preconditioners for rank deficient least squares problems

  • Cerdán Soriano, Juana Mercedes
  • Marín Mateos-Aparicio, José|||0000-0002-7825-2836
  • Mas Marí, José|||0000-0002-2835-974X
  • Guerrero, D.
[EN] In this paper we present a method for computing sparse preconditioners for iteratively solving rank deficient least squares problems (LS) by the LSMR method. The main idea of the method proposed is to update an incomplete factorization computed for a regularized problem to recover the solution of the original one. The numerical experiments for a wide set of matrices arising from different science and engineering applications show that the preconditioner proposed, in most cases, can be successfully applied to accelerate the convergence of the iterative Krylov subspace method., This work was supported by the Spanish Ministerio de Economia, Industria y Competitividad, Spain under grants MTM2017-85669-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Jordan structures of irreducible totally nonnegative matrices with a prescribed sequence of the first p-indices

  • Cantó Colomina, Begoña|||0000-0002-9837-3926
  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[EN] Let A be an nxn irreducible totally nonnegative matrix with rank r and principal rank p, that is, A is irreducible with all minors nonnegative, r is the size of the largest invertible square submatrix of A and p is the size of its largest invertible principal submatrix. We consider the sequence {1,i_2,...,i_p} of the first p-indices of A as the first initial row and column indices of a p×p invertible principal submatrix of A. A triple (n,r,p) is called (1,i_2,...,i_p)-realizable if there exists an irreducible totally nonnegative matrix A¿R_n×n with rank r, principal rank p, and {1, i_2,...,i_p} is the sequence of its first p-indices. In this work we study the Jordan structures corresponding to the zero eigenvalue of irreducible totally nonnegative matrices associated with a triple (n,r,p) (1,i_2,...,i_p)-realizable., This research was supported by the Ministerio de Economia y Competividad under the Spanish DGI grant MTM2017-85669-P-AR
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Modal methods for the neutron diffusion equation using different spatial modes

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The behaviour of the neutrons inside a nuclear reactor core can be modelled by using the time dependent neutron diffusion equation. Different time schemes have been used to integrate this equation. One possibility is to use a modal method, which is based on the expansion of the neutron flux in terms of spatial modes that are the eigenfunctions associated with a given configuration of the reactor core. Several spatial modes can be defined for the neutron diffusion equation such as the ¿, ¿ and ¿-modes. In this work, the ¿, the ¿ and the ¿-modes have been used to develop different modal kinetics equations, using a high order finite element method for the spatial discretization of the neutron diffusion equation. The performance of the different modal kinetic equations has been tested and compared using two 3D transient benchmark problems., This work has been partially supported by Spanish Ministerio de Economía y Competitividad under projects ENE2017-89029-P, MTM2017-85669P and BES-2015-072901.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

CMMSE algorithms for constructing doubly stochastic matrices with the relative gain array (combined matrix) A circle A(-T)

  • Fuster Capilla, Robert Ricard
  • Gasso Matoses, María Teresa
  • Gimenez Manglano, María Isabel
[EN] The Combined matrix of a nonsingular matrix A is defined by phi(A)=A T where degrees means the Hadamard (entrywise) product. If the matrix A describes the relation between inputs and outputs in a multivariable process control, phi(A) describes the relative gain array (RGA) of the process and it defines the Bristol method (IEEE Trans Autom Control 1:133-134, 1966) often used for Chemical processes (McAvoy in Interaction analysis: principles and applications. Instrument Society of America, Pittsburgh, 1983; Papadourakis et al. in Ind Eng Chem Res 26(6):1259-1262, 1987; Wang et al. in Chem Eng Technol, 10.1002/ceat.201500202, 2016; Kariwala et al. in Ind Eng Chem Res 45(5):1751-1757, 10.1021/ie050790r, 2006; Golender et al. in J Chem Inf Comput Sci 21(4):196-204, 10.1021/ci00032a004, 1981). The combined matrix has been studied in several works such as Bru et al. (J Appl Math, 10.1155/2014/182354, 2014), Fiedler and Markham (Linear Algebra Appl 435:1945-1955, 2011) and Johnson and Shapiro (SIAM J Algebraic Discrete Methods 7:627-644, 1986). Since phi(A)=(cij) has the property of Sigma kcik=Sigma kckj=1,i,j, when phi(A)>= 0, phi(A) is a doubly stochastic matrix. In certain chemical engineering applications a diagonal of the RGA in wchich the entries are near 1 is used to determine the pairing of inputs and outputs for further design analysis. Applications of these matrices can be found in Communication Theory, related with the satellite-switched time division multiple-access systems, and about a doubly stochastic automorphism of a graph. In this paper we present new algorithms to generate doubly stochastic matrices with the Combined matrix using Hessenberg matrices in Sect.3 and orthogonal/unitary matrices in Sect.4. In addition, we discuss what kind of doubly stochastic matrices are obtained with our algorithms and the possibility of generating a particular doubly stochastic matrix by the map phi., This work has been supported by Spanish Ministerio de Economia y Competitividad Grants MTM2014-58159-P, MTM2017-85669-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

All Jordan canonical forms of irreducible totally non-negative matrices

  • Cantó Colomina, Begoña|||0000-0002-9837-3926
  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[EN] Let be an irreducible totally non-negative matrix with rank r and principal rank p, that is, every minor of A is non-negative and p is the size of the largest invertible principal submatrix of A. Using Number Theory, we calculate the number of Jordan canonical forms of irreducible totally non-negative matrices associated with a realizable triple . Moreover, by using full rank factorizations of A and applying the Flanders theorem we obtain all these Jordan canonical forms. Finally, some algorithms associated with these results are given, This research was partially supported by the Ministerio de Economia y Competitividad under the Spanish DGI grant MTM2017-85669-P-AR
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Multilevel matrix-free preconditioner to solve linear systems associated with a the time-dependent SPN equations

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The evolution of the neutronic power inside of a nuclear reactor core can be approximated by means of the diffusive time-dependent simplified spherical harmonics equations (SPN). For the spatial discretization of these equations, a continuous Galerkin high order finite element method is applied to obtain a semi-discrete system of equations that is usually stiff. A semi-implicit time scheme is used for the time discretization and many linear systems are needed to be solved and previously, preconditioned. The aim of this work is to speed up the convergence of the linear systems solver with a multilevel preconditioner that uses different degrees of the polynomials used in the finite element method. Furthermore, as the matrices that appear in this type of system are very large and sparse, a matrix-free implementation of the preconditioner is developed to avoid the full assembly of the matrices. A benchmark transient tests this methodology. Numerical results show, in comparison with the block Gauss-Seidel preconditioner, an improvement in terms of number of iterations and the necessity of computational resources., This work has been partially supported by Spanish Ministerio de Economía y Competitividad under projects ENE2017-89029-P and MTM2017-85669-P. Furthermore, this work has been financed by the Generalitat Valenciana under the project PROMETEO/2018/035.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Sobre las Matrices Totalmente No Positivas

  • Cantó Colomina, Begoña|||0000-0002-9837-3926
  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[ES] En este trabajo presentamos un procedimiento para construir un tipo de matrices llamadas totalmente no positivas, estudiar sus propiedades y obtener las relaciones que tienen con otra clase de matrices llamadas totalmente no negativas., Este trabajo ha sido financiado por el proyecto MTM2017-85669-P-AR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A direct method to obtain a realization of a polynomial matrix and its applications

  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Moll López, Santiago Emmanuel|||0000-0003-3388-5135
  • Ricarte Benedito, Beatriz|||0000-0001-8094-1908
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[EN] In this paper we present a Silverman-Ho algorithm-based method to obtain a realization of a polynomial matrix. This method provides the final formulation of a minimal realization directly from a full rank factorization of a specific given matrix. Also, some classical problems in control theory such as model reduction in singular systems or the positive realization problem in standard systems are solved with this method., Work supported by the Spanish DGI grant MTM2017-85669-P-AR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A block Arnoldi method for the SPN equations

  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Carreño, Amanda|||0000-0003-2302-1157
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The simplified spherical harmonics equations are a useful approximation to the stationary neutron transport equation. The eigenvalue problem associated with them is a challenging problem from the computational point of view. In this work, we take advantage of the block structure of the involved matrices to propose the block inverse-free preconditioned Arnoldi method as an efficient method to solve this eigenvalue problem. For the spatial discretization, a continuous Galerkin finite element method implemented with a matrix-free technique is used to keep reasonable memory demands. A multilevel initialization using linear shape functions in the finite element method is proposed to improve the method convergence. This initialization only takes a small percentage of the total computational time. The proposed eigenvalue solver is compared to the standard power iteration method, the Krylov-Schur method and the generalized Davidson method. The numerical results show that it reduces the computational time to solve the eigenvalue problem., This work has been partially supported by Spanish Ministerio de Economia y Competitividad under projects ENE2017-89029-P, MTM2017-85669-P and BES-2015-072901. Moreover, it has been supported by the Catedra of the CSN Vicente Serradell
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Irreducible totally nonnegative matrices with a prescribed Jordan structure

  • Cantó Colomina, Begoña|||0000-0002-9837-3926
  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[EN] Let A be an irreducible totally nonnegative matrix with rank r and principal rank p, that is, all minors of A are nonnegative, r is the size of the largest invertible square submatrix of A and p is the size of its largest invertible principal submatrix. A triple (n,r,p) is called realizable if there exists an n*n irreducible totally nonnegative matrix A with rank r and principal rank p. In this work we present a method to construct irreducible totally nonnegative matrices associated with a realizable triple (n,r,p) and with a prescribed Jordan canonical form corresponding to its zero eigenvalue., This research was supported by the Ministerio de Economia y Competitividad under the Spanish DGI grant MTM2017-85669-P-AR
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Time-dependent simplified spherical harmonics formulations for a nuclear reactor system

  • Carreño, Amanda|||0000-0003-2302-1157
  • Vidal-Ferràndiz, Antoni|||0000-0001-5449-7356
  • Ginestar Peiro, Damián|||0000-0003-1243-6648
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The steady-state simplified spherical harmonics equations (SPNequations) are a higher order approximation to the neutron transport equations than the neutron diffusion equation that also have reasonable computational demands. This work extends these results for the analysis of transients by comparing of two formulations of time-dependent SPN equations considering different treatments for the time derivatives of the field moments. The first is the full system of equations and the second is a diffusive approximation of these equations that neglects the time derivatives of the odd moments. The spatial discretization of these methodologies is made by using a high order finite element method. For the time discretization, a semi-implicit Euler method is used. Numerical results show that the diffusive formulation for the time-dependent simplified spherical harmonics equations does not present a relevant loss of accuracy while being more computationally efficient than the full system, This work has been partially supported by Spanish Ministerio de Economia y Competitividad under projects ENE2017-89029-P and MTM2017-85669-P. Furthermore, this work has been financed by the Generalitat Valenciana under the project PROMETEO/2018/035
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On the maximum rank of totally nonnegative matrices

  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[EN] Let A is an element of R-nxn be a totally nonnegative matrix with principal rank p, that is, every minor of A is nonnegative and p is the size of the largest invertible principal submatrix of A. We introduce the sequence of the first p-indices of A as the first initial row and column indices of a p x p invertible principal submatrix of A with rank p. Then, we study the linear dependence relations between the rows and columns indexed by the sequence of the first p-indices of A and the remaining of its rows and columns. These relations, together with the irreducibility property of some submatrices of A, allow us to present an algorithm that calculates the maximum rank of A as a function of the distribution of the first p-indices. Finally, we present a method to construct n x n totally nonnegative matrices with given rank r, principal rank p and a specific sequence of the first p-indices. (C) 2018 Elsevier Inc. All rights reserved., This research was supported by the Spanish DGI grants MTM2013-43678-P, MTM2017-85669-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Diagonal entries of the combined matrix of sign regular matrices of arder three

  • Gasso Matoses, María Teresa
  • Gil, Ivan
  • Gimenez Manglano, María Isabel
  • Santana-De Asis, Máximo De Jesús
  • Segura, Elaine
[EN] The study of the diagonal entries of the combined matrix of a nonsingular matrix A has been considered by different authors for the classes of Mmatrices, positive definite matrices and totally positive (negative) matrices. This problem appears to be difficult as the results have been done only for matrices of order three. In this work, we continue to give the characterization ofthe diagonal entries ofthe combined matrix ofthe remainder sign regular matrices. Thus, the problem is closed for all possible sign regular matrices of order three., Supported by Spanish Ministerio de Economía y Competitividad grants MTM2017-85669-P and MTM2017-90682-REDT and Dominican Republic FONDOCYT grant number 2015-1D2-166