Academic literature on the topic 'Domain decomposition technique'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Domain decomposition technique.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Domain decomposition technique"

1

Leumüller, Michael, Karl Hollaus, and Joachim Schöberl. "Domain decomposition and upscaling technique for metascreens." COMPEL - The international journal for computation and mathematics in electrical and electronic engineering 41, no. 3 (2022): 938–53. http://dx.doi.org/10.1108/compel-03-2021-0073.

Full text
Abstract:
Purpose This paper aims to consider a multiscale electromagnetic wave problem for a housing with a ventilation grill. Using the standard finite element method to discretise the apertures leads to an unduly large number of unknowns. An efficient approach to simulate the multiple scales is introduced. The aim is to significantly reduce the computational costs. Design/methodology/approach A domain decomposition technique with upscaling is applied to cope with the different scales. The idea is to split the domain of computation into an exterior domain and multiple non-overlapping sub-domains. Each sub-domain represents a single aperture and uses the same finite element mesh. The identical mesh of the sub-domains is efficiently exploited by the hybrid discontinuous Galerkin method and a Schur complement which facilitates the transition from fine meshes in the sub-domains to a coarse mesh in the exterior domain. A coarse skeleton grid is used on the interface between the exterior domain and the individual sub-domains to avoid large dense blocks in the finite element discretisation matrix. Findings Applying a Schur complement to the identical discretisation of the sub-domains leads to a method that scales very well with respect to the number of apertures. Originality/value The error compared to the standard finite element method is negligible and the computational costs are significantly reduced.
APA, Harvard, Vancouver, ISO, and other styles
2

Arina, Renzo, and Marco Falossi. "Domain decomposition technique for aeroacoustic simulations." Applied Numerical Mathematics 49, no. 3-4 (2004): 263–75. http://dx.doi.org/10.1016/j.apnum.2003.12.006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chan, Tony F. C., and Tarek P. Mathew. "The Interface Probing Technique in Domain Decomposition." SIAM Journal on Matrix Analysis and Applications 13, no. 1 (1992): 212–38. http://dx.doi.org/10.1137/0613018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

GUO, ZHAOLI, CHUGUANG ZHENG, and BAOCHANG SHI. "DOMAIN-DECOMPOSITION TECHNIQUE IN LATTICE BOLTZMANN METHOD." International Journal of Modern Physics B 17, no. 01n02 (2003): 129–33. http://dx.doi.org/10.1142/s0217979203017205.

Full text
Abstract:
In this paper a domain-decomposition technique is proposed in the framework of the lattice Boltzmann method in order to handle flows in irregular geometries. The 2D flow in a channel with a square or slant branch cavity is simulated based on this technique.
APA, Harvard, Vancouver, ISO, and other styles
5

Bramble, James H., and Joseph E. Pasciak. "A domain decomposition technique for stokes problems." Applied Numerical Mathematics 6, no. 4 (1990): 251–61. http://dx.doi.org/10.1016/0168-9274(90)90019-c.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Agbehadji, Israel Edem, Richard C. Millham, Emmanuel Freeman, Wanqing Wu, and Xianbin Zhang. "Fused Multi-Domains and Adaptive Variational Mode Decomposition ECG Feature Extraction for Lightweight Bio-Inspired Key Generation and Encryption." Sensors 24, no. 24 (2024): 7926. https://doi.org/10.3390/s24247926.

Full text
Abstract:
Security is one of the increasingly significant issues given advancements in technology that harness data from multiple devices such as the internet of medical devices. While protecting data from unauthorized user access, several techniques are used including fingerprints, passwords, and others. One of the techniques that has attracted much attention is the use of human features, which has proven to be most effective because of the difficulties in impersonating human-related features. An example of a human-related attribute includes the electrical signal generated from the heart, mostly referred to as an Electrocardiogram (ECG) signal. The methods to extract features from ECG signals are time domain-based; however, the challenge with relying only on the time-domain or frequency-domain method is the inability to capture the intra-leading relationship of Variational Mode Decomposition signals. In this research, fusing multiple domains ECG feature and adaptive Variational Mode Decomposition approaches are utilized to mitigate the challenge of losing the intra-leading correlations of mode decompositions, which might reduce the robustness of encryption algorithms. The features extracted using the reconstructed signal have a mean (0.0004), standard deviation (0.0391), skewness (0.1562), and kurtosis (1.2205). Among the lightweight encryption methods considered, Chacha20 has a total execution time of 27µs. The study proposes a lightweight encryption technique based on the fused vector representation of extracted features to provide an encryption scheme in addition to a bio-inspired key generation technique for data encryption.
APA, Harvard, Vancouver, ISO, and other styles
7

Osorio, Luana Nobre, Bruno Pereira-Dias, André Bulcão, and Luiz Landau. "Migration deconvolution using domain decomposition." GEOPHYSICS 86, no. 3 (2021): S247—S256. http://dx.doi.org/10.1190/geo2020-0352.1.

Full text
Abstract:
Least-squares migration (LSM) is an effective technique for mitigating blurring effects and migration artifacts generated by limited data frequency bandwidth, incomplete coverage of geometry, source signature, and unbalanced amplitudes caused by complex wavefield propagation in the subsurface. Migration deconvolution (MD) is an image-domain approach for LSM that approximates the Hessian operator using a set of precomputed point spread functions. We have developed a new workflow by integrating the MD and domain decomposition (DD) methods. DD techniques aim to solve large and complex linear systems by splitting problems into smaller parts, facilitating parallel computing, and providing a higher convergence in iterative algorithms. We suggest that instead of solving the problem in a unique domain, as conventionally performed, splitting the problem into subdomains that overlap and solve each of them independently. We accelerate the convergence rate of the conjugate-gradient solver by applying the DD methods to retrieve better reflectivity, which is mainly visible in regions with low amplitudes. Moreover, using the pseudo-Hessian operator, the convergence of the algorithm is accelerated, suggesting that the inverse problem becomes better conditioned. Experiments using the synthetic Pluto model demonstrate that our algorithm dramatically reduces the required number of iterations while providing a considerable enhancement in image resolution and better continuity of poorly illuminated events.
APA, Harvard, Vancouver, ISO, and other styles
8

SUZUKI, Yoshiro. "A domain decomposition technique based on the multiscale seamless-domain method." Mechanical Engineering Journal 4, no. 4 (2017): 17–00145. http://dx.doi.org/10.1299/mej.17-00145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Agoshkov, V. I. "New Technique for Formulation of Domain Decomposition Algorithms." Computational Mathematics and Mathematical Physics 60, no. 3 (2020): 353–69. http://dx.doi.org/10.1134/s0965542520030021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Delgado, Carlos, Eliseo García, and Felipe Cátedra. "Fast Hybrid Computational Technique for the Analysis of Radome Structures Using Dual Domain Decomposition." Electronics 10, no. 18 (2021): 2196. http://dx.doi.org/10.3390/electronics10182196.

Full text
Abstract:
This work details a technique tailored to the analysis of complex radome structures based on the non-overlapping separation of two different domains: antenna and radome. Both domains are analyzed isolated using the method of moments with the multilevel fast multipole algorithm (MoM-MLFMA) for the antenna domain and a modified characteristic basis function method with the multilevel fast multipole algorithm approach for the radome domain. An iterative procedure is then applied to compute the effect of each domain over the complementary domain. This approach usually converges into a few iterations, yielding very good results and significant efficiency improvements with respect to other efficient approaches such as a full-wave MoM-MLFMA analysis of the full problem. A realistic test case is included, considering a radome with an embedded frequency selective structure on one of its interfaces. The results show a very good agreement considering only three iterations between domains, requiring only one-third of the CPU-time needed by the conventional approach.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Domain decomposition technique"

1

Globisch, G. "On an automatically parallel generation technique for tetrahedral meshes." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800499.

Full text
Abstract:
In order to prepare modern finite element analysis a program for the efficient parallel generation of tetrahedral meshes in a wide class of three dimensional domains having a generalized cylindric shape is presented. The applied mesh generation strategy is based on the decomposition of some 2D-reference domain into single con- nected subdomains by means of its triangulations the tetrahedral layers are built up in parallel. Adaptive grid controlling as well as nodal renumbering algorithms are involved. In the paper several examples are incorporated to demonstrate both program's capabilities and the handling with.
APA, Harvard, Vancouver, ISO, and other styles
2

Ivanov, S. A., and V. G. Korneev. "On the preconditioning in the domain decomposition technique for the p-version finite element method. Part I." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800856.

Full text
Abstract:
Abstract P-version finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary re- sults for 1D case, condition number estimates and some inequalities for 2D reference element.
APA, Harvard, Vancouver, ISO, and other styles
3

Ivanov, S. A., and V. G. Korneev. "On the preconditioning in the domain decomposition technique for the p-version finite element method. Part II." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800862.

Full text
Abstract:
P-version finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary results for 1D case, condition number estimates and some inequalities for 2D reference element. Part II is devoted to the derivation of the Schur complement preconditioner and conditionality number estimates for the p-version finite element matrixes. Also DD preconditioning is considered.
APA, Harvard, Vancouver, ISO, and other styles
4

Haque, Amil. "Modeling of the excited modes in inverted embedded microstrip lines using the finite-difference time-domain (FDTD) technique." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26582.

Full text
Abstract:
Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009.<br>Committee Chair: Tentzeris, Emmanouil; Committee Member: Andrew Peterson; Committee Member: Laskar, Joy; Committee Member: Papapolymerou, Ioannis. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
5

Su, G. H., of Western Sydney Nepean University, and School of Civic Engineering and Environment. "A new development in domain decomposition techniques for analysis of plates with mixed edge supports." THESIS_XXX_CEE_Su_G.xml, 2000. http://handle.uws.edu.au:8081/1959.7/277.

Full text
Abstract:
The importance of plates, with discontinuities in boundary supports in aeronautical and marine structures, have led to various techniques to solve plate problems with mixed edge support conditions. The domain decomposition method is one of the most effective of these techniques, providing accurate numerical solutions. This method is used to investigate the vibration and buckling of flat, isotropic, thin and elastic plates with mixed edge support conditions. Two practical approaches have been developed as an extension of the domain decomposition method, namely, the primary-secondary domain (PSD) approach and the line-domains (LD) approach. The PSD approach decomposes a plate into one primary domain and one/two secondary domain(s). The LD approach considers interconnecting boundaries as dominant domains whose basic functions take a higher edge restraint from the neighbouring edges. Convergence and comparison studies are carried out on a number of selected rectangular plate cases. Extensive practical plate problems with various shapes, combinations of mixed boundary conditions and different inplane loading conditions have been solved by the PSD and LD approaches.<br>Master of Engineering (Hons)
APA, Harvard, Vancouver, ISO, and other styles
6

Nepomnyaschikh, S. V. "Domain Decomposition and Multilevel Techniques for Preconditioning Operators." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800815.

Full text
Abstract:
Introduction In recent years, domain decomposition methods have been used extensively to efficiently solve boundary value problems for partial differential equations in complex{form domains. On the other hand, multilevel techniques on hierarchical data structures also have developed into an effective tool for the construction and analysis of fast solvers. But direct realization of multilevel techniques on a parallel computer system for the global problem in the original domain involves difficult communication problems. I this paper, we present and analyze a combination of these two approaches: domain decomposition and multilevel decomposition on hierarchical structures to design optimal preconditioning operators.
APA, Harvard, Vancouver, ISO, and other styles
7

Gilliocq-Hirtz, Diane. "Techniques variationnelles et calcul parallèle en imagerie : Estimation du flot optique avec luminosité variable en petits et larges déplacements." Thesis, Mulhouse, 2016. http://www.theses.fr/2016MULH8379/document.

Full text
Abstract:
Le travail présenté dans cette thèse porte sur l'estimation du flot optique par méthodes variationnelles en petits et en grands déplacements. Nous proposons un modèle basé sur la combinaison locale-globale à laquelle nous ajoutons la prise en compte des variations de la luminosité. La particularité de ce manuscrit réside dans l'utilisation de la méthode des éléments finis pour la résolution des équations. En effet, cette méthode se fait pour le moment très rare dans le domaine du flot optique. Grâce à ce choix de résolution, nous proposons d'implémenter un contrôle local de la régularisation ainsi qu'une adaptation de maillage permettant d'affiner la solution au niveau des arêtes de l'image. Afin de réduire les temps de calcul, nous parallélisons les programmes. La première méthode implémentée est la méthode parallèle en temps appelée pararéel. En couplant un solveur grossier et un solveur fin, cet algorithme permet d'accélérer les calculs. Pour pouvoir obtenir un gain de temps encore plus important et également traiter les séquences en haute définition, nous utilisons ensuite une méthode de décomposition de domaine. Combinée au solveur massivement parallèle MUMPS, cette méthode permet un gain de temps de calcul significatif. Enfin, nous proposons de coupler la méthode de décomposition de domaine et le pararéel afin de profiter des avantages de chacune. Dans une seconde partie, nous appliquons tous ces modèles dans le cas de l'estimation du flot optique en grands déplacements. Nous proposons de nous servir du pararéel afin de traiter la non-linéarité de ce problème. Nous terminons par un exemple concret d'application du flot optique en restauration de films<br>The work presented in this thesis focuses on the estimation of the optical flow through variational methods in small and large displacements. We propose a model based on the combined local-global strategy to which we add the consideration of brightness intensity variations. The particularity of this manuscript is the use of the finite element method to solve the equations. Indeed, for now, this method is really rare in the field of the optical flow. Thanks to this choice of resolution, we implement an adaptive control of the regularization and a mesh adaptation to refine the solution on the edges of the image. To reduce computation times, we parallelize the programs. The first method implemented is a parallel in time method called parareal. By combining a coarse and a fine solver, this algorithm speeds up the computations. To save even more time and to also be able to handle high resolution sequences, we then use a domain decomposition method. Combined with the massively parallel solver MUMPS, this method allows a significant reduction of computation times. Finally, we propose to couple the domain decomposition method and the parareal to have the benefits of both methods. In the second part, we apply all these models to the case of the optical flow estimation in large displacements. We use the parareal method to cope with the non-linearity of the problem. We end by a concrete example of application of the optical flow in film restoration
APA, Harvard, Vancouver, ISO, and other styles
8

Healy, Timothy M. "Multi-block and overset-block domain decomposition techniques for cardiovascular flow simulation." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/15622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Malek, Alaeddin. "Numerical spectral solution of elliptic partial differential equations using domain decomposition techniques." Thesis, Cardiff University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241798.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Odry, Nans. "Méthode de décomposition de domaine avec parallélisme hybride et accélération non linéaire pour la résolution de l'équation du transport Sn en géométrie non-structurée." Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4058/document.

Full text
Abstract:
Les schémas de calcul déterministes permettent une modélisation à moindre coût du comportement de la population de neutrons en réacteur, mais sont traditionnellement construits sur des approximations (décomposition réseau/cœur, homogénéisation spatiale et énergétique…). La thèse revient sur une partie de ces sources d’erreur, de façon à rapprocher la méthode déterministe d’un schéma de référence. L’objectif est de profiter des architectures informatiques modernes (HPC) pour résoudre le problème neutronique à l’échelle du cœur 3D, tout en préservant l’opérateur de transport et une partie des hétérogénéités de la géométrie. Ce travail est réalisé au sein du solveur cœur Sn Minaret de la plateforme de calcul Apollo3® pour des réacteurs à neutrons rapides.Une méthode de décomposition de domaine en espace, est retenue. L'idée consiste à décomposer un problème de grande dimension en sous-problèmes "indépendants" de taille réduite. La convergence vers la solution globale est assurée par échange de flux angulaires entre sous-domaines au cours d'un processus itératif. En favorisant un recours massif au parallélisme, les méthodes de décomposition de domaine contribuent à lever les contraintes en mémoire et temps de calcul. La mise en place d'un parallélisme hybride, couplant les technologies MPI et OpenMP, est en particulier propice au passage sur supercalculateur. Une méthode d'accélération de type Coarse Mesh Rebalance est ajoutée pour pallier à la pénalité de convergence constatée sur la méthode de décomposition de domaine. Le potentiel du nouveau schéma est finalement mis en évidence sur un coeur CFV 3D, construit en préservant l'hétérogénéité des assemblages absorbants<br>Deterministic calculation schemes are devised to numerically solve the neutron transport equation in nuclear reactors. Dealing with core-sized problems is very challenging for computers, so much that the dedicated core codes have no choice but to allow simplifying assumptions (assembly- then core-scale steps…). The PhD work aims to correct some of these ‘standard’ approximations, in order to get closer of reference calculations: thanks to important increases in calculation capacities (HPC), nowadays one can solve 3D core-sized problems, using both high mesh refinement and the transport operator. Developments were performed inside the Sn core solver Minaret, from the new CEA neutronics platform Apollo3® for fast neutrons reactors of the CFV-kind.This work focuses on a Domain Decomposition Method in space. The fundamental idea involves splitting a core-sized problem into smaller and 'independent' subproblems. Angular flux is exchanged between adjacent subdomains. In doing so, all combined subproblems converge to the global solution at the outcome of an iterative process. Domain decomposition is well-suited to massive parallelism, allowing much more ambitious computations in terms of both memory requirements and calculation time. An hybrid MPI/OpenMP parallelism is chosen to match the supercomputers architecture. A Coarse Mesh Rebalance accelration technique is added to balance the convergence penalty observed using Domain Decomposition. The potential of the new calculation scheme is demonstrated on a 3D core of the CFV-kind, using an heterogeneous description of the absorbent rods
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Domain decomposition technique"

1

S, Hirsh Richard, and Langley Research Center, eds. Parallel pseudospectral domain decomposition techniques. National Aeronautics and Space Administration, Langley Research Center, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Magoulès, F., ed. Substructuring Techniques and Domain Decomposition Methods. Saxe-Coburg Publications, 2010. http://dx.doi.org/10.4203/csets.24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

F, Magoulès, ed. Mesh partitioning techniques and domain decomposition methods. Saxe-Coburg Publications, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

F, Magoulès, ed. Mesh partitioning techniques and domain decomposition methods. Saxe-Coburg Publications, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

L, Škerget, Power H, and Popov V. 1961-, eds. Domain decomposition techniques for boundary elements: Application to fluid flow. WIT Press, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

National Aeronautics and Space Administration (NASA) Staff. Parallel Pseudospectral Domain Decomposition Techniques. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Popov, V., H. Power, and L. Škerget, eds. Domain Decomposition Techniques for Boundary Elements. WIT Press, 2007. http://dx.doi.org/10.2495/978-1-84564-100-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Substructuring techniques and domain decomposition methods. Saxe-Coburg Publications, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Domain decomposition techniques for boundary elements: Application to fluid flow. WIT Press, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

(Editor), V. Popov, H. Power (Editor), and L. Skerget (Editor), eds. Domain Decomposition Techniques for Boundary Elements (Advances in Boundary Elements) (Advances in Boundary Elements) (Advances in Boundary Elements) (Advances in Boundary Elements). WIT Press, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Domain decomposition technique"

1

Turner, James, Michal Kočvara, and Daniel Loghin. "A Nonlinear Domain Decomposition Technique for Scalar Elliptic PDEs." In Lecture Notes in Computational Science and Engineering. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05789-7_84.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Amador, Sandro, Martin Ørum, Tobias Friis, and Rune Brincker. "Application of Frequency Domain Decomposition Identification Technique to Half Spectral Densities." In Topics in Modal Analysis & Testing, Volume 9. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74700-2_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tallec, Patrick Le. "Numerical Homogeneisation Technique with Domain Decomposition Based a-posteriori Error Estimates." In Lecture Notes in Computational Science and Engineering. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02677-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Elahi, Amir Reza, Alessandro Cardoni, Marco Domaneschi, and Gian Paolo Cimellaro. "Automating the Frequency Domain Decomposition Technique Using the Modal Assurance Criterion." In Lecture Notes in Civil Engineering. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21187-4_92.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Papadopoulos, C. A., J. M. Sloss, and J. C. Bruch. "A Domain Decomposition Technique Applied to a Free Surface Seepage Problem." In Numerical Methods for Free Boundary Problems. Birkhäuser Basel, 1991. http://dx.doi.org/10.1007/978-3-0348-5715-4_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tiwari, Sudarshan, Axel Klar, and Steffen Hardt. "Simulations of Micro Channel Gas Flows with Domain Decomposition Technique for Kinetic and Fluid Dynamics Equations." In Lecture Notes in Computational Science and Engineering. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05789-7_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kharbaoui, Y., O. Askour, B. Braikat, A. Tri, H. Zahrouni, and M. Potier-Ferry. "Coupling of the Method of Fundamental Solutions and the Domain Decomposition Technique for Solving Laplace Equation." In Lecture Notes in Mechanical Engineering. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-46973-2_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Formaggia, Luca, Marzio Sala, and Fausto Saleri. "Domain Decomposition Techniques." In Lecture Notes in Computational Science and Engineering. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/3-540-31619-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Amador, Sandro Diord R., Manuel Aenlle Lopez, and Pelayo Fernández. "On the Initial Assessment of a New Complex Frequency Domain Decomposition (C-FDD) Technique Formulated in Modal Model." In Lecture Notes in Civil Engineering. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-61421-7_65.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Awasthi, Divyanshu, Priyank Khare, and Vinay Kumar Srivastava. "A Secured Dual Image Watermarking technique using QR decomposition, Hénon map, and Chaotic encryption in wavelet domain and its authentication using BRISK." In Digital Image Security. CRC Press, 2024. http://dx.doi.org/10.1201/9781003468974-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Domain decomposition technique"

1

Bauchau, Olivier, and Seundo Heo. "A Novel Parallel Algorithm for Rotor Dynamics Simulation." In Vertical Flight Society 70th Annual Forum & Technology Display. The Vertical Flight Society, 2014. http://dx.doi.org/10.4050/f-0070-2014-9550.

Full text
Abstract:
Domain decomposition techniques combined with the finite element tearing and interconnecting (FETI) method has become popular for parallel computations in finite element analysis. In the original FETI method, the continuity of the displacement field across the sub-domain boundaries is enforced via the classical Lagrange multiplier technique. In this paper, domain decomposition is used as well, but continuity conditions are imposed via the "localized Lagrange multiplier" technique. In this approach, interface nodes are created and continuity conditions are enforced between the displacements of the boundary nodes and those of the interface nodes. The presence of the interface nodes maximizes the independence of the sub-domains and enables the use of augmented Lagrangian terms that improve the numerical conditioning of the problem. The localized Lagrange multiplier technique is formulated within the finite element framework and the solution procedure of domain-decomposed problem is described in detail. The proposed approach has been implemented in Dymore, a finite element based multibody dynamics code for comprehensive rotorcraft simulation.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhu, Jinlong, and Lynford Goddard. "Defect inspection using a time-domain mode decomposition technique." In Metrology, Inspection, and Process Control for Microlithography XXXII, edited by Ofer Adan and Vladimir A. Ukraintsev. SPIE, 2018. http://dx.doi.org/10.1117/12.2297443.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Erhart, Kevin, Eduardo Divo, and Alain J. Kassab. "A Parallel Domain Decomposition Boundary Element Method Technique for Large-Scale Transient Heat Conduction Problems." In ASME 2004 Heat Transfer/Fluids Engineering Summer Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/ht-fed2004-56104.

Full text
Abstract:
In this paper, we develop a parallel domain decomposition Laplace transform BEM algorithm for the solution of transient heat conduction problems. The original domain is decomposed into a number of sub-domains, a procedure is described to provide a good initial guess for the domain interface temperatures, and an iteration is carried out to satisfy continuity of temperature and heat flux at the domain interfaces. The decomposition procedure significantly reduces the size of any single problem to be tackled by the BEM, significantly reduces the overall storage and computational burden, and renders the application of the BEM to modeling large transient conduction problem feasible on modest computational platforms. The procedure is readily implemented in parallel and applicable to 3D problems. Moreover, as the approach described herein readily allows adaptation and integration of traditional BEM codes, it is expected that the domain decomposition approach coupled to parallel implementation should prove very competitive to alternatives proposed in the literature such as fast multipole acceleration methods that require a complete re-write of traditional BEM codes.
APA, Harvard, Vancouver, ISO, and other styles
4

Uzgoren, Eray, Wei Shyy, and Marc Garbey. "Parallelized Domain Decomposition Techniques for Multiphase Flow." In ASME 2004 Heat Transfer/Fluids Engineering Summer Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/ht-fed2004-56079.

Full text
Abstract:
Direct simulation of multiphase flows is a challenging task due to the moving interface and property variations between phases. In this study, a parallel domain decomposition method is implemented for such flows to lower the computing cost. Specifically, the approach consists of the additive Schwarz method for domain decomposition, the projection method for the Navier-Stokes equations, the immersed boundary method for treating the interfacial dynamics, and the multigrid method to expedite the solution of the pressure Poisson equation. The issues related to load balancing, communication and computation, scalability in regard to grid size and the number of processors, and interface shape deformation, are studied using both SGI Altix and Linux-based Beowulf systems. As the number of processors increases, as expected, the domain decomposition technique results in modest decrease in convergence rate, while the multigrid technique is effective in reducing the computational cost. The additional computational cost incurred by the immersed boundary method for tracking the interface is not significant.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Baoqing, and Fang Zhou. "Technique for interactive wavelet extraction and decomposition in cepstrum domain." In SEG Technical Program Expanded Abstracts 2007. Society of Exploration Geophysicists, 2007. http://dx.doi.org/10.1190/1.2793020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kilic, Emre, Ole Neitz, and Thomas F. Eibert. "A finite element boundary element domain decomposition inverse scattering technique." In 2015 International Conference on Electromagnetics in Advanced Applications (ICEAA). IEEE, 2015. http://dx.doi.org/10.1109/iceaa.2015.7297262.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Divo, Eduardo, Alain J. Kassab, Eric Mitteff, and Luis Quintana. "A Parallel Domain Decomposition Technique for Meshless Methods Applications to Large-Scale Heat Transfer Problems." In ASME 2004 Heat Transfer/Fluids Engineering Summer Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/ht-fed2004-56004.

Full text
Abstract:
Mesh reduction methods such as the boundary element methods, method of fundamental solutions or the so-called meshless methods all lead to fully populated matrices. This poses serious challenges for large-scale three-dimensional problems due to storage requirements and iterative solution of a large set of non-symmetric equations. Researchers have developed several approaches to address this issue including the class of fast-multipole techniques, use of wavelet transforms, and matrix decomposition. In this paper, we develop a domain-decomposition, or the artificial sub-sectioning technique, along with a region-by-region iteration algorithm particularly tailored for parallel computation to address the coefficient matrix issue. The meshless method we employ is based on expansions using radial basis functions (RBFs). An efficient physically-based procedure provides an effective initial guess of the temperatures along the sub-domain interfaces. The iteration process converges very efficiently, offers substantial savings in memory, and features superior computational efficiency. The meshless iterative domain decomposition technique is ideally suited for parallel computation. We discuss its implementation under MPI standards on a small Windows XP PC cluster. Numerical results reveal the domain decomposition meshless methods produce accurate temperature predictions while requiring a much-reduced effort in problem preparation in comparison to other traditional numerical methods.
APA, Harvard, Vancouver, ISO, and other styles
8

Elhadidi, Basman, and Mohamed Sayed. "Sound Scattering from Acoustically Treated Bodies Using a Domain Decomposition Technique." In 15th AIAA/CEAS Aeroacoustics Conference (30th AIAA Aeroacoustics Conference). American Institute of Aeronautics and Astronautics, 2009. http://dx.doi.org/10.2514/6.2009-3309.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Livesey, Matthew, James F. Stack, Fumie Costen, Takeshi Nanri, Seiji Fujino, and Norimasa Nakashima. "An alternative domain decomposition technique for CUDA-based 3D FDTD methods." In 2012 42nd European Microwave Conference (EuMC 2012). IEEE, 2012. http://dx.doi.org/10.23919/eumc.2012.6459089.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Jianing, and Xiaojian Xu. "A domain decomposition based technique for 2-D sea surface generation." In 2013 6th International Congress on Image and Signal Processing (CISP). IEEE, 2013. http://dx.doi.org/10.1109/cisp.2013.6745276.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Domain decomposition technique"

1

Liang, Yu, Ramdev Kanapady, and Kumar Tamma. An Efficient Parallel Finite-Element-Based Domain Decomposition Iterative Technique With Polynomial Preconditioning. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada439487.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chefetz, Benny, and Baoshan Xing. Sorption of hydrophobic pesticides to aliphatic components of soil organic matter. United States Department of Agriculture, 2003. http://dx.doi.org/10.32747/2003.7587241.bard.

Full text
Abstract:
Sorption of hydrophobic compounds to aliphatic components of soil organic matter (SOM) is poorly understood even though these aliphatic carbons are a major fraction of SOM. The main source of aliphatic compounds in SOM is above- and below-ground plant cuticular materials (cutin, cutan and suberin). As decomposition proceeds, these aliphatic moieties tend to accumulate in soils. Therefore, if we consider that cuticular material contributes significantly to SOM, we can hypothesize that the cuticular materials play an important role in the sorption processes of hydrophobic compounds (including pesticides) in soils, which has not yet been studied. The overall goal of this research was to illustrate the mechanism and significance of the refractory aliphatic structures of SOM in sorbing hydrophobic compounds (nonionic and weakly polar pesticides). The importance of this study is related to our ability to demonstrate the sorption relationship between key pesticides and an important fraction of SOM. The specific objectives of the project were: (1) To isolate and characterize cuticular fractions from selected plants; (2) To investigate the sorption mechanism of key hydrophobic pesticides and model compounds to cuticular plant materials; (3) To examine the sorption mechanisms at the molecular level using spectroscopic techniques; (4) To investigate the sorption of key hydrophobic pesticides to synthetic polymers; (5) To evaluate the content of cuticular materials in agricultural soils; and (6) To study the effect of incubation of plant cuticular materials in soils on their sorptive capabilities. This project demonstrates the markedly high sorption capacity of various plant cuticular fractions for hydrophobic organic compounds (HOCs) and polar organic pollutants. Both cutin (the main polymer of the cuticle) and cutan biopolymers exhibit high sorption capability even though both sorbents are highly aliphatic in nature. Sorption by plant cuticular matter occurs via hydrophobic interactions and H-bonding interactions with polar sorbates. The cutin biopolymer seems to facilitate reversible and noncompetitive sorption, probably due to its rubbery nature. On the other hand, the epicuticular waxes facilitate enhance desorption in a bi-solute system. These processes are possibly related to phase transition (melting) of the waxes that occur in the presence of high solute loading. Moreover, our data highlight the significance of polarity and accessibility of organic matter in the uptake of nonpolar and polar organic pollutants by regulating the compatibility of sorbate to sorbent. In summary, our data collected in the BARD project suggest that both cutin and cutan play important roles in the sorption of HOCs in soils; however, with decomposition the more condensed structure of the cutin and mainly the cutan biopolymer dominated sorption to the cuticle residues. Since cutin and cutan have been identified as part of SOM and humic substances, it is suggested that retention of HOCs in soils is also controlled by these aliphatic domains and not only by the aromaticrich fractions of SOM.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography