Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 76 results
  • Numerical Solution of 3-D Electromagnetic Problems in Exploration Geophysics and its Implementation on Massively Parallel Computers  Open access

     Koldan, Jelena
    Universitat Politècnica de Catalunya
    Theses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    La creciente importancia, el desarrollo técnico y el empleo de métodos electromagnéticos (EM) en geofísica de exploraciónhan dado lugar a la necesidad de técnicas fiables y rápidas de la interpretación de los datos EM en 3-D adquiridos en escenarios geológicos complejos. El primer paso y el más importante en la creación de un método de inversión es el desarrollo de un programa para el problema directo. Con el fin de crear una inversión EM 3-D eficiente, fiable y práctica, es necesario disponer de un código para modelización EM 3-D que sea preciso, robusto y rápido. Esta tesis se centra precisamente en este paso crucial en la construcción de un método de interpretación EM 3-D. La tesis presenta como su principal contribución un método numérico para modelización EM 3-D en geofísica que es muy preciso, muy rápido, escalable y robusto, basado en elementos finitos (FE) y que fue diseñado para funcionar en plataformas de supercomputación. Gracias al hecho de que FE soporta mallas tetraédricas completamente no estructuradas, así como refinamientos locales de malla, el método es capaz de representar geometrías complejas de las estructuras del subsuelo de forma muy precisa y por lo tanto mejorar la precisión de la solución y evitar artefactos engañosos en las imágenes. La paralelización del método, que se basa en la descomposición de dominio y un esquema de MPI-OpenMP híbrido, ha demostrado ser altamente escalable ¿ el incremento de velocidad lograda está cerca de la lineal para más de un millón de procesadores. Gracias a esto, el código es capaz de resolver problemas muy grandes (de cientos de millones de grados de libertad) de una manera muy eficiente. La importancia de tener este codigo para problemas directos reside en el hecho de que ahora es posible crear una inversión EM 3-D que se puede tratar con los datos obtenidos en entornos geológicos muy complejos de una manera realista para el uso práctico en la industria. Hasta ahora, tales métodos no se ha propuesto debido a la falta de soluciones eficientes y paralelas basadas en FE, así como a las limitaciones de codigos eficientes basados ¿¿en diferencias finitas. Además, la tesis analiza los aspectos y retos físicos, matemáticos y numéricos de la modelización EM 3-D, que se han estudiado durante mi investigación con el fin de diseñar correctamente el software presentado para simulaciones de campo EM en regiones 3-D de la Tierra. A través de este trabajo, una formulación del problema físico basada en los potenciales EM secundarios Coulomb-gauged ha sido validada y ha demostrado que se puede utilizar con éxito con el método FE estándar para dar soluciones numéricas de alta precisión. Además, este trabajo ha demostrado que los métodos de subespacios de Krylov son la mejor solución para resolver sistemas lineales que surgen después de la discretización en FE del problema en cuestión. Más concretamente, se ha descubierto empíricamente que el mejor método iterativo para este tipo de problemas es BiCGStab con un elaborado precondicionador. Como precondicionadores más comúnmente utilizados demostraron ser incapaces de mejorar la convergencia de los métodos iterativos implementados en la medida deseada, o han resultado poco prácticos en el contexto paralelo, he propuesto una técnica de precondicionamiento para los métodos de Krylov que se basa en multigrid algebraica. Las pruebas de los diversos problemas con diferentes estructuras y características de conductividad han demostrado que el nuevo precondicionador mejora en gran medida la convergencia de los diferentes métodos de Krylov, lo que reduce significativamente el tiempo total de ejecución del programa y mejora la calidad de la solución. Por otra parte, el precondicionador es muy práctico para la aplicación en paralelo. No hay restricciones en el empleo de modelos clásicos de programación paralela, MPI y OpenMP, para la paralelización del método FE presentado. Además, son suficiente para proporcionar una excelente escalabilidad.

    The growing significance, technical development and employment of electromagnetic (EM) methods in exploration geophysics have led to the increasing need for reliable and fast techniques of interpretation of 3-D EM data sets acquired in complex geological environments. The first and most important step to creating an inversion method is the development of a solver for the forward problem. In order to create an efficient, reliable and practical 3-D EM inversion, it is necessary to have a 3-D EM modelling code that is highly accurate, robust and very fast. This thesis focuses precisely on this crucial and very demanding step to building a 3-D EM interpretation method. The thesis presents as its main contribution a highly accurate, robust, very fast and extremely scalable numerical method for 3-D EM modelling in geophysics that is based on finite elements (FE) and designed to run on massively parallel computing platforms. Thanks to the fact that the FE approach supports completely unstructured tetrahedral meshes as well as local mesh refinements, the presented solver is able to represent complex geometries of subsurface structures very precisely and thus improve the solution accuracy and avoid misleading artefacts in images. Consequently, it can be successfully used in geological environments of arbitrary geometrical complexities. The parallel implementation of the method, which is based on the domain decomposition and a hybrid MPI-OpenMP scheme, has proved to be highly scalable - the achieved speed-up is close to the linear for more than a thousand processors. Thanks to this, the code is able to deal with extremely large problems, which may have hundreds of millions of degrees of freedom, in a very efficient way. The importance of having this forward-problem solver lies in the fact that it is now possible to create a 3-D EM inversion that can deal with data obtained in extremely complex geological environments in a way that is realistic for practical use in industry. So far, such imaging tool has not been proposed due to a lack of efficient, parallel FE solutions as well as the limitations of efficient solvers based on finite differences. In addition, the thesis discusses physical, mathematical and numerical aspects and challenges of 3-D EM modelling, which have been studied during my research in order to properly design the presented software for EM field simulations on 3-D areas of the Earth. Through this work, a physical problem formulation based on the secondary Coulomb-gauged EM potentials has been validated, proving that it can be successfully used with the standard nodal FE method to give highly accurate numerical solutions. Also, this work has shown that Krylov subspace iterative methods are the best solution for solving linear systems that arise after FE discretisation of the problem under consideration. More precisely, it has been discovered empirically that the best iterative method for this kind of problems is biconjugate gradient stabilised with an elaborate preconditioner. Since most commonly used preconditioners proved to be either unable to improve the convergence of the implemented solvers to the desired extent, or impractical in the parallel context, I have proposed a preconditioning technique for Krylov methods that is based on algebraic multigrid. Tests for various problems with different conductivity structures and characteristics have shown that the new preconditioner greatly improves the convergence of different Krylov subspace methods, which significantly reduces the total execution time of the program and improves the solution quality. Furthermore, the preconditioner is very practical for parallel implementation. Finally, it has been concluded that there are not any restrictions in employing classical parallel programming models, MPI and OpenMP, for parallelisation of the presented FE solver. Moreover, they have proved to be enough to provide an excellent scalability for it.

  • Assessing accelerator-based HPC reverse time migration

     Araya Polo, Mauricio; Cabezas, Javier; Hanzich, Mauricio; Pericas, Miquel; Rubio, Fèlix; Gelado Fernandez, Isaac; Shafiq, Muhammad; Morancho Llena, Enrique; Navarro Mas, Nacho; Ayguade Parra, Eduard; Cela Espin, Jose M.; Valero Cortes, Mateo
    IEEE transactions on parallel and distributed systems
    Vol. 22, num. 1, p. 147-162
    DOI: 10.1109/TPDS.2010.144
    Date of publication: 2011-01
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    High-performance reverse time migration on GPU  Open access

     Cabezas, Javier; Ayala Polo, Mauricio; Gelado Fernandez, Isaac; Morancho Llena, Enrique; Navarro Mas, Nacho; Cela Espin, Jose M.
    International Conference of the Chilean Computer Science Society
    p. 77-86
    DOI: 10.1109/SCCC.2009.19
    Presentation's date: 2009-11
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Partial Differential Equations (PDE) are the heart of most simulations in many scientific fields, from Fluid Mechanics to Astrophysics. One the most popular mathematical schemes to solve a PDE is Finite Difference (FD). In this work we map a PDE-FD algorithm called Reverse Time Migration to a GPU using CUDA. This seismic imaging (Geophysics) algorithm is widely used in the oil industry. GPUs are natural contenders in the aftermath of the clock race, in particular for High-performance Computing (HPC). Due to GPU characteristics, the parallelism paradigm shifts from the classical threads plus SIMD to Single Program Multiple Data (SPMD). The NVIDIA GTX 280 implementation outperforms homogeneous CPUs up to 9x (Intel Harpertown E5420) and up to 14x (IBM PPC 970). These preliminary results confirm that GPUs are a real option for HPC, from performance to programmability.

  • Coherent Stark nonlinear spectroscopy with chirped pulses

     Serrat Jurado, Carles; Loiko, Yury; Cruz, De La R; Cela Espin, Jose M.
    Physical review A
    Vol. 75, num. 1, p. 13819-819-4
    Date of publication: 2007-01
    Journal article

     Share Reference managers Reference managers Open in new window

  • Performance of computation-intensive, parameter sweep applications on Internet-based Grids of computers. The mapping of molecular potential energy hypersurfaces

     Sebastian, Reyes; Camelia, Muñoz; Alfonso, Niño; Badia Sala, Rosa Maria; Cela Espin, Jose M.
    Concurrency and Computation: Practice and Experience
    Vol. 19, num. 4, p. 1
    Date of publication: 2007-03
    Journal article

     Share Reference managers Reference managers Open in new window

  • A workload distribution pattern for grid environments

     Cela Espin, Jose M.
    2007 International Conference on Grid Computing and Applications (CGA 2007)
    Presentation's date: 2007-06-25
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Estrategias de descomposición en dominios para entornos Grid.

     Otero Calviño, Beatriz
    Department of Computer Architecture, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • Data Distribution Strategies for Domain Decomposition Applications in Grid Environments

     Otero Calviño, Beatriz; Cela Espin, Jose M.; Badia Sala, Rosa Maria; Labarta Mancho, Jesus Jose
    Lecture notes in computer science
    num. 3719, p. 214-224
    Date of publication: 2005-10
    Journal article

     Share Reference managers Reference managers Open in new window

  • Performance Analysis of Domain Decomposition Applications Using Unbalanced Strategies in Grid Environments

     Otero Calviño, Beatriz; Cela Espin, Jose M.; Badia Sala, Rosa Maria; Labarta Mancho, Jesus Jose
    Lecture notes in computer science
    Vol. 3795, p. 1031-1042
    Date of publication: 2005-12
    Journal article

     Share Reference managers Reference managers Open in new window

  • Development and performance of a grid computing approach to the massive exploration of potential energy hypersurfaces for spectroscopic studies

     Cela Espin, Jose M.
    The Nineteenth Colloquium on High Resolution Molecular Spectroscopy
    Presentation's date: 2005-09-11
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Development and performance of a grid computing approach to the massive exploration of potential energy hypersurfaces for spectroscopic studies

     Badia Sala, Rosa Maria; Cela Espin, Jose M.
    The Nineteenth Colloquium on High Resolution Molecular Spectroscopy
    p. 1
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Data Distribution Strategies for Domain Decomposition Applications in Grid Environments

     Otero Calviño, Beatriz; Cela Espin, Jose M.; Badia Sala, Rosa Maria; Labarta Mancho, Jesus Jose
    6th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP
    p. 214-224
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Performance Analysis of Domain Decomposition . Applications Using Unbalanced Strategies in Grid Environments

     Otero Calviño, Beatriz; Cela Espin, Jose M.; Badia Sala, Rosa Maria; Labarta Mancho, Jesus Jose
    The fourth International Conference on Grid and Cooperative Computing
    p. 1031-1042
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Domain Decomposition Strategy for GRID Environments

     Otero Calviño, Beatriz; Cela Espin, Jose M.; Badia Sala, Rosa Maria; Labarta Mancho, Jesus Jose
    Lecture notes in computer science
    Vol. 1, num. 3241, p. 353-361
    Date of publication: 2004-09
    Journal article

     Share Reference managers Reference managers Open in new window

  • Latencia y ancho de banda para simular ambientes GRID

     Otero Calviño, Beatriz; Cela Espin, Jose M.
    Date: 2004-07
    Report

     Share Reference managers Reference managers Open in new window

  • A Domain Decomposition Strategy for GRID Environments

     Otero Calviño, Beatriz; Cela Espin, Jose M.; Badia Sala, Rosa Maria; Labarta Mancho, Jesus Jose
    Recent Advances in Parallel Virtual Machine and Message Passing Interface
    p. 353-361
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A Domain Decomposition Strategy for GRID Environments

     Cela Espin, Jose M.
    Recent Advances in Parallel Virtual Machine and Message Passing Interface
    Presentation's date: 2004-09-19
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A Parallel Computing Model for the Acceleration of a Finite Element Software

     Montleau, Pierre De; Cela Espin, Jose M.; Serge, Moto Mpong; Godinass, André
    Lecture notes in computer science
    p. 449-456
    Date of publication: 2003-05
    Journal article

     Share Reference managers Reference managers Open in new window

  • Programming Grid Applications with GRID Superscalar

     Badia Sala, Rosa Maria; Labarta Mancho, Jesus Jose; Sirvent, Raul; Josep, M Perez; Cela Espin, Jose M.; Rogeli, Grima
    Journal of grid computing
    Vol. 1, num. 2, p. 151-170
    Date of publication: 2003-12
    Journal article

     Share Reference managers Reference managers Open in new window

  • Different surface models for progressive lenses and their effect in parallelization

     Fontdecaba Baig, Enric; Cela Espin, Jose M.; Otero Calviño, Beatriz
    Modeling and simulation
    p. 443-448
    Date of publication: 2003-09
    Journal article

     Share Reference managers Reference managers Open in new window

  • Different Surface Models for Progressive Lenses and their Effect in Parallelization

     Otero Calviño, Beatriz; Cela Espin, Jose M.; Fontdecaba, Enric
    3rd IASTED International Conference on Power and Energy Systems
    p. 443-448
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Different Surface Models Forprogressive Lenses and their Effect in Parallelization

     Cela Espin, Jose M.
    3rd IASTED International Conference on Power and Energy Systems
    Presentation's date: 2003-09-03
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Modelización de superficies ópticas para su implementación en máquinas paralelas

     Otero Calviño, Beatriz; Cela Espin, Jose M.; Fontdecaba Baig, Enric
    Date: 2002-05
    Report

     Share Reference managers Reference managers Open in new window

  • Intercampus: Administration and Teaching shared between eight Catalan universities through Internet

     Calviño Tavares, Francisco; Añaños, E; Cabrera, N; Cela Espin, Jose M.; Gisbert, D Folch M; Izquierdo, F; Pelach, J
    E-Learn 2002. World Conference on E-Learning in Corporate, Government, Healthcare, & higher Education
    p. 1269-1272
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A Parallel Computing Model for the Acceleration of a Finite Element Software

     Montleau, Pierre De; Cela Espin, Jose M.; Serge, Moto Mpong; Godinass, André
    4th International Symposium on High Performance Computing (ISHPC 2002)
    p. 449-456
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Intercampus: Administration and Teaching Shared by Universities in a Virtual Campus

     Calviño Tavares, Francisco; Añaños, E; Cabrera, N; Cela Espin, Jose M.; Folch, D; Gisbert, M; Izquierdo, F; Pelach, J
    Online Educa 2002
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Intercampus. Ejemplo de plataforma de gestión y docencia compartidas entre universidades a través de la red

     Añaños, E; Cabrera, N; Calviño Tavares, Francisco; Cela Espin, Jose M.; Folch, D; Gisbert, M; Izquierdo, F; Pelach, J; Parellada, J; Viader, M; Pedró, F
    Virtual Educa 2002
    p. 1-8
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Intercampus: resultats de 5 semestres d'administració i docència compartides entre universitats catalanes a través d'internet

     Añaños, E; Cabrera, N; Calviño Tavares, Francisco; Cela Espin, Jose M.; Folch, D; Gisbert, M; Izquierdo, F; Pèlach, Q; Parellada, J; Pedró, F
    Congrés Internacional de Docència Universitària i Innovació
    p. 1-22
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Técnicas Algebraicas de Precondicionamiento para la resolución de Sistemas Lineales  Open access

     Larrazabal Serrano, German Alberto
    Department of Computer Architecture, Universitat Politècnica de Catalunya
    Theses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Esta tesis se centra en el estudio de tecnicas de precondicionamiento para la resolucion de sistemas lineales de ecuaciones, provenientes de la resolucion de ecuaciones diferenciales en derivadas parciales. La caracteristica comun de los sistemas lineales objeto de interes es su enorme tamano, y el hecho de que la matriz de coeficientes asociada a estos sistemas es dispersa. Se utilizan los modelos de programacion de paso de mensajes y memoria compartida, y se orienta este trabajo a problemas de un tamano medio, hasta 10^5 ecuaciones. La resolucion de sistemas lineales de ecuaciones es, comunmente, el nucleo computacional mas costoso, en cuanto a tiempo de ejecucion, de muchas simulaciones numericas industriales, aunque otros problemas tales como calculo de autovalores tambien suelen ocurrir.Tipicamente, estos problemas consumen una significante porcion del tiempo computacional requerido por una simulacion completa. Una reciente revision sobre el actual uso de supercomputadores de alto rendimiento indica que mas del 70% del tiempo computacional es usado para resolver grandes sistemas lineales de ecuaciones. Un impacto industrial muy importante debe ocurrir si el rendimiento de los metodos usados para resolver estos sistemas pudiera ser mejorado. El problema de resolver sistemas lineales ha sido ampliamente analizado para arquitecturas de memoria compartida, donde el paralelismo que se suele explotar es de grano fino. Sin embargo, el interes en explotar el paralelismo grano grueso, junto con la aparicion de librerias que garantizan la portabilidad de los programas basados en paso de mensaje y junto al avance de la tecnologia, ha hecho posible que en estos momentos se este comenzado a desarrollar aplicaciones industriales sobre multicomputadores de memoria compartida-distribuida. Las tecnicas de descomposicion en dominios son una forma de distribucion de datos que permiten la explotacion del paralelismo de paso de mensaje, y todo el paralelismo interno de cada dominio permite la explotacion del paralelismo de memoria compartida.En esta tesis se intenta cubrir todos los aspectos teoricos y algoritmicos de los metodos mas usados para resolver sistemas lineales dispersos de ecuaciones. Por ello en primer lugar, se estudia los metodos iterativos más importantes, las técnicas más comunes de precondicionamiento y los metodos multinivel.En segundo lugar, se analiza la formulacion numerica del problema y su paralelismo, y se propone el uso de un precondicionador paralelo que disminuye significativamente el tiempo de ejecucion. Finalmente, se muestran los resultados obtenidos para un conjunto de problemas provenientes de la resolucion de ecuaciones diferenciales en derivadas parciales.

    The study of preconditioning techniques to solve linear systems arising to solve partial differential equations is the focus of this thesis. The common feature of the matrices associated to linear systems are large size and sparse. We use two programming models: message passing and threads. This work has been oriented to solve problems up to 10^5 freedom degree.The problem to solve linear systems is, frecuently, the computational kernel most expensive (execution time) of many numerical industrial simulations, although others problems such as eigenvalues compute usually it appear. Typically, it problems consume a significant part of the computational time required by a complete simulation. A newly review about the high performance supercomputers suggest that 70% or more of the computational time is used to solve large linear systems. An industrial impact very important should happen if the performance of the methods used to solve these linear systems can be improved. The problem to solve linear systems has been analized to shared memory architecture, where the paralelism that it exploit is fine grain. Nevertheless, the interest to exploit coarse grain paralelism together with the developed of library where it guarantee portability of the programs based in message passing and together with technology advancement has done possible that in this moment the programmer's develop industrial applications on supercomputers with shared-distributed memory. The domain decomposition techniques are a way to exploit the data distribution that permit the explotation of message passing paralelism, and all the internal paralelism in each domain permit the explotation of the shared memory paralelism (threads).In this thesis, I have tried to include all the theorycal and algorithmics aspect of the methods used more often to solve sparse linear system of equations. The first one, I have studied the iterative methods more important, the algebraic preconditioning technique and multilevel methods. The second one, I have analized the numerical formulation of the problem and it paralelism, and I have proposed to use a parallel preconditioner where it reduce the execution time of the algorithm. Finally, I have showed the numerical results for a set problems arising partial differential equations.

  • A Parallel Algebraic Preconditioner for the Schur Complement System

     Larrazabal, German; Cela Espin, Jose M.
    IEEE International Parallel and Distributed Processing Symposium
    p. 1
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Towards a Global Algebraic Preconditioner for the Schur System

     Larrazabal, German; Cela Espin, Jose M.
    Date: 2000-11
    Report

     Share Reference managers Reference managers Open in new window

  • Two Algebraic Approximations for the Global Term of the Schur Matrix

     Larrazabal, German; Cela Espin, Jose M.
    Date: 2000-11
    Report

     Share Reference managers Reference managers Open in new window

  • Sparse Matrix Structure for Dynamic Parallelisation Efficiency

     Markus, Art; Barrado Muxí, Cristina; Cela Espin, Jose M.; Fischer, Rolf; Labarta Mancho, Jesus Jose; Laborda, Oscar; Hartmut, Manz; Schulz, Uwe
    Euro-Par
    p. 519-526
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Introducción a la programación en c

     Cela Espin, Jose M.; Peña Basurto, Marco Antonio
    Date of publication: 2000-09-30
    Book

     Share Reference managers Reference managers Open in new window

  • High Performance Algorithms for Progressive Addition Lens Design

     Fontdecaba Baig, Enric
    Department of Computer Architecture, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • Study of SPAI preconditioners for convective problems

     Larrazabal, German; Cela Espin, Jose M.
    Date: 1999-06
    Report

     Share Reference managers Reference managers Open in new window

  • Computational issues in optimizing ophthalmic lens

     Fontdecaba, Enric; Cela Espin, Jose M.; Dursteler, Juan C
    4th International ACPC Conference on Parallel Computation
    p. 173-182
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Computational issues in optimizing ophthalmic lens

     Cela Espin, Jose M.
    4th International ACPC Conference on Parallel Computation
    Presentation's date: 1999-02-16
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Influence of the Sparse Matrix Structure on Automatic Parallelisation Efficiency

     Ast, M; Barrado Muxí, Cristina; Cela Espin, Jose M.; FISHER, R; Labarta Mancho, Jesus Jose; Laborda Sanchez, Oscar; Manz, H; Schulz, U
    Date: 1999-09
    Report

     Share Reference managers Reference managers Open in new window

  • ESPRIT Nº 24757 TTN-OPTIPAR - A PARALLEL OPTIMISATION TOOL FOR OPTICAL DESIGN

     Valero Cortes, Mateo; Labarta Mancho, Jesus Jose; Cela Espin, Jose M.
    Competitive project

     Share

  • Parallel Optimisation for Optical Lens Design

     Fontdecaba Baig, Enric; Cela Espin, Jose M.; Dürsteler, Juan C Lopez
    3rd. International Meeting on Vector and Parallel Processing
    p. 657-662
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • On the Parallelisation of Non-Linear Optimisation Algorithms for Ophthalmic Lens Design

     Cela Espin, Jose M.
    International Conference on Information Technology Interfaces
    Presentation's date: 1998-06-16
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • On the Parallelisation of Non-Linear Optimisation Algorithm for Ophthalmic Lens Design

     Fontdecaba Baig, Enric; Cela Espin, Jose M.; Dursteler, Juan C
    International Conference on Information Technology Interfaces
    p. 142-148
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Parallel Optimisation for Optical Lens Design

     Cela Espin, Jose M.
    3rd. International Meeting on Vector and Parallel Processing
    Presentation's date: 1998-06-21
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • ESPRIT 25000 HIPSID-HIGH PERFORMANCE SIMULATION FOR INTERACTIVE DESIGN

     Cela Espin, Jose M.; Labarta Mancho, Jesus Jose; Valero Cortes, Mateo
    Competitive project

     Share

  • Stampar: a parallel processing approach for the explicit dynamic analysis of sheet stamping problems

     Neamtu, L.; Zarate Araiza, Jose Francisco; Oñate Ibáñez de Navarra, Eugenio; DUFFETT, G.A.; Cela Espin, Jose M.
    Euro-Par
    p. 1370-1374
    Presentation's date: 1997
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • ALGORISMES PARAL.LELS DE DESCOMPOSICIÓ EN DOMINIS PER A LA RESOLUCIÓ DE SISTEMES LINIALS

     Cela Espin, Jose M.
    Department of Computer Architecture, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window