The paper proposes a new approach to the fast solution of matrix equations resulting from boundary element discretization of integral equations. By hybridizing fast iterative $mathcal {H}$-matrix solvers with a fast direct $mathcal {H}$-matrix preconditioner factorization, we create a framework that can be tuned between the extremes of a direct solver and a unpreconditioned iterative solver. This tuning is largely achieved using a single numerical parameter representing the preconditioner tolerance. A more complicated scheme involving two different tolerances is also briefly considered. The proposed framework is demonstrated on a high-order accurate Locally Corrected Nyström solution of surface integral equations for PEC targets. Examples consider various scattering problems including those featuring strong physical resonances. We show that appropriately choosing the preconditioner tolerance achieves the prescribed solution accuracy with minimal CPU time. Expanding from one to two tolerance parameters further enhances the framework by providing the flexibility to dynamically adjust tolerance, enabling higher compression while maintaining accuracy and fast convergence. This adaptive strategy offers significant potential for optimizing the balance between memory usage and CPU time in the future.
{"title":"Optimal Preconditioners for Hybrid Direct-Iterative $mathcal {H}$-Matrix Solvers in Boundary Element Methods","authors":"Omid Babazadeh;Emrah Sever;Jin Hu;Ian Jeffrey;Constantine Sideris;Vladimir Okhmatovski","doi":"10.1109/JMMCT.2025.3547827","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3547827","url":null,"abstract":"The paper proposes a new approach to the fast solution of matrix equations resulting from boundary element discretization of integral equations. By hybridizing fast iterative <inline-formula><tex-math>$mathcal {H}$</tex-math></inline-formula>-matrix solvers with a fast direct <inline-formula><tex-math>$mathcal {H}$</tex-math></inline-formula>-matrix preconditioner factorization, we create a framework that can be tuned between the extremes of a direct solver and a unpreconditioned iterative solver. This tuning is largely achieved using a single numerical parameter representing the preconditioner tolerance. A more complicated scheme involving two different tolerances is also briefly considered. The proposed framework is demonstrated on a high-order accurate Locally Corrected Nyström solution of surface integral equations for PEC targets. Examples consider various scattering problems including those featuring strong physical resonances. We show that appropriately choosing the preconditioner tolerance achieves the prescribed solution accuracy with minimal CPU time. Expanding from one to two tolerance parameters further enhances the framework by providing the flexibility to dynamically adjust tolerance, enabling higher compression while maintaining accuracy and fast convergence. This adaptive strategy offers significant potential for optimizing the balance between memory usage and CPU time in the future.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"187-197"},"PeriodicalIF":1.8,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-04DOI: 10.1109/JMMCT.2025.3547852
Nils Kielian;Marcus Stiemer
A robust data-transfer process for balanced domain decomposition is presented. This algorithm reduces the number of mesh elements required to solve certain 3D multiscale problems with the finite element method. In some examples, a reduction factor of up to 5 has been observed. The reduction is achieved by introducing an overlapping auxiliary domain to an originally non-overlapping domain decomposition scheme, allowing for individual meshing of the subdomains. The data transfer to couple the individually meshed subdomains is performed with the help of barycentric interpolation. Hence, the advantages of parallel solution of subdomain problems is combined with a stable inter-subdomain data transfer. The developed algorithm can be applied on problems with a scalar valued second order spatial elliptic differential operator in various fields of engineering, such as semiconductors, huge and complex biological cell clusters, heat conducting and pressure problems on multiple scales.
{"title":"Fast Domain Decomposition Algorithm Using Barycentric Interpolation and Overlapping Subdomains for 3D Multiscale Problems","authors":"Nils Kielian;Marcus Stiemer","doi":"10.1109/JMMCT.2025.3547852","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3547852","url":null,"abstract":"A robust data-transfer process for balanced domain decomposition is presented. This algorithm reduces the number of mesh elements required to solve certain 3D multiscale problems with the finite element method. In some examples, a reduction factor of up to 5 has been observed. The reduction is achieved by introducing an overlapping auxiliary domain to an originally non-overlapping domain decomposition scheme, allowing for individual meshing of the subdomains. The data transfer to couple the individually meshed subdomains is performed with the help of barycentric interpolation. Hence, the advantages of parallel solution of subdomain problems is combined with a stable inter-subdomain data transfer. The developed algorithm can be applied on problems with a scalar valued second order spatial elliptic differential operator in various fields of engineering, such as semiconductors, huge and complex biological cell clusters, heat conducting and pressure problems on multiple scales.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"198-208"},"PeriodicalIF":1.8,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10909529","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-20DOI: 10.1109/JMMCT.2025.3544143
Yifan Wang;Dan Jiao
In this paper, we develop a new one-stage $ O(N log N)$ algorithm to generate a rank-minimized $mathcal {H}^{2}$-representation of electrically large volume integral equations (VIEs), which significantly reduces the CPU run time of state-of-the-art algorithms for completing the same task. Unlike existing two-stage algorithms, this new algorithm requires only one stage to build nested cluster bases. The cluster basis is obtained directly from the interaction between a cluster and its admissible clusters composed of real or auxiliary ones that cover all interaction directions. Furthermore, the row and column pivots of the resultant low-rank representation are chosen from the source and observer points in an analytical way without the need for numerically finding them. This further speeds up the computation. Numerical experiments on a suite of electrically large 3D scattering problems have demonstrated the efficiency and accuracy of the proposed new algorithm.
{"title":"One-Stage $ O(N log N)$ Algorithm for Generating Nested Rank-Minimized Representation of Electrically Large Volume Integral Equations","authors":"Yifan Wang;Dan Jiao","doi":"10.1109/JMMCT.2025.3544143","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3544143","url":null,"abstract":"In this paper, we develop a new one-stage <inline-formula><tex-math>$ O(N log N)$</tex-math></inline-formula> algorithm to generate a rank-minimized <inline-formula><tex-math>$mathcal {H}^{2}$</tex-math></inline-formula>-representation of electrically large volume integral equations (VIEs), which significantly reduces the CPU run time of state-of-the-art algorithms for completing the same task. Unlike existing two-stage algorithms, this new algorithm requires only one stage to build nested cluster bases. The cluster basis is obtained directly from the interaction between a cluster and its admissible clusters composed of real or auxiliary ones that cover all interaction directions. Furthermore, the row and column pivots of the resultant low-rank representation are chosen from the source and observer points in an analytical way without the need for numerically finding them. This further speeds up the computation. Numerical experiments on a suite of electrically large 3D scattering problems have demonstrated the efficiency and accuracy of the proposed new algorithm.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"169-178"},"PeriodicalIF":1.8,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-20DOI: 10.1109/JMMCT.2025.3544270
Praveen Singh;Soumyashree S. Panda;Jogesh C. Dash;Bright Riscob;Surya K. Pathak;Ravi S. Hegde
Antenna synthesis is becoming increasingly challenging with tight requirements for C-SWAP (cost, size, weight and power) reduction while maintaining stringent electromagnetic performance specifications. While machine learning approaches are increasingly being explored for antenna synthesis, they are still not capable of handling large shape sets with diverse responses. We propose a branched deep convolutional neural network architecture that can serve as a drop-in replacement for a full-wave simulator (it can predict the full spectral response of reflection co-efficient, input impedance and radiation pattern). We show the utility of such models in surrogate-assisted evolutionary optimization for antenna synthesis with arbitrary specification of targeted response. Specifically, we consider the large shape set defined by the set of 16-vertexes polygonal patch antennas and consider antenna synthesis by specifying independent constraints on return loss, radiation pattern and gain. In contrast to online surrogates, our approach is an offline surrogate that is objective-agnostic; trained once, it can be used over multiple optimizations whereby the model training costs become amortized across multiple synthesis requests. Our approach outperforms evolutionary optimizations relying on full-wave solver-based fitness estimation. Specifically, we report the design, fabrication and experimental characterization of three polygon-shaped patch antennas, each fulfilling different objectives (narrow band, dual-band & wide-band). The reported methodology enables rapid synthesis (in seconds), produces verifiable sound designs and is promising for furthering data-driven design methodologies for electromagnetic wave device synthesis.
{"title":"Rapid Multi-Objective Antenna Synthesis via Deep Neural Network Surrogate-Driven Evolutionary Optimization","authors":"Praveen Singh;Soumyashree S. Panda;Jogesh C. Dash;Bright Riscob;Surya K. Pathak;Ravi S. Hegde","doi":"10.1109/JMMCT.2025.3544270","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3544270","url":null,"abstract":"Antenna synthesis is becoming increasingly challenging with tight requirements for C-SWAP (cost, size, weight and power) reduction while maintaining stringent electromagnetic performance specifications. While machine learning approaches are increasingly being explored for antenna synthesis, they are still not capable of handling large shape sets with diverse responses. We propose a branched deep convolutional neural network architecture that can serve as a drop-in replacement for a full-wave simulator (it can predict the full spectral response of reflection co-efficient, input impedance and radiation pattern). We show the utility of such models in surrogate-assisted evolutionary optimization for antenna synthesis with arbitrary specification of targeted response. Specifically, we consider the large shape set defined by the set of 16-vertexes polygonal patch antennas and consider antenna synthesis by specifying independent constraints on return loss, radiation pattern and gain. In contrast to online surrogates, our approach is an offline surrogate that is objective-agnostic; trained once, it can be used over multiple optimizations whereby the model training costs become amortized across multiple synthesis requests. Our approach outperforms evolutionary optimizations relying on full-wave solver-based fitness estimation. Specifically, we report the design, fabrication and experimental characterization of three polygon-shaped patch antennas, each fulfilling different objectives (narrow band, dual-band & wide-band). The reported methodology enables rapid synthesis (in seconds), produces verifiable sound designs and is promising for furthering data-driven design methodologies for electromagnetic wave device synthesis.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"151-159"},"PeriodicalIF":1.8,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-17DOI: 10.1109/JMMCT.2025.3542379
Tiago V. L. Amorim;Elson J. Silva;Fernando J. S. Moreira;Fernando L. Teixeira
We present a novel modular implementation of the discontinuous Galerkin time-domain (DGTD) method to effectively address electromagnetic problems involving general dielectric dispersive media modeled through vector fitting. This approach includes an extended dispersive perfectly matched layer to directly truncate dispersive materials, allowing for the modeling of open domains. The proposed modular and concise DGTD implementation, based on the complex-conjugate pole-residue model, offers flexibility and simplifies the handling of complex medium problems. We apply the formulation to both two-dimensional and three-dimensional canonical scattering problems, demonstrating good agreement with their respective analytical solutions.
{"title":"Modular Discontinuous Galerkin Time-Domain Method for General Dispersive Media With Vector Fitting","authors":"Tiago V. L. Amorim;Elson J. Silva;Fernando J. S. Moreira;Fernando L. Teixeira","doi":"10.1109/JMMCT.2025.3542379","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3542379","url":null,"abstract":"We present a novel modular implementation of the discontinuous Galerkin time-domain (DGTD) method to effectively address electromagnetic problems involving general dielectric dispersive media modeled through vector fitting. This approach includes an extended dispersive perfectly matched layer to directly truncate dispersive materials, allowing for the modeling of open domains. The proposed modular and concise DGTD implementation, based on the complex-conjugate pole-residue model, offers flexibility and simplifies the handling of complex medium problems. We apply the formulation to both two-dimensional and three-dimensional canonical scattering problems, demonstrating good agreement with their respective analytical solutions.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"179-186"},"PeriodicalIF":1.8,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-04DOI: 10.1109/JMMCT.2025.3538602
Zhong Yuan Pang;Bo O. Zhu
Numerical analysis of static field problems is often encountered in science and engineering. The boundary element methods based on integral equations are popular due to small number of unknowns and high computational efficiency. Conventional boundary element methods require conformal meshes on the interface between two contact dielectric objects, which are more complicated to generate than non-conformal meshes. This paper presents a boundary element integral equation method compatible with non-conformal meshes on the interface between contacting objects. In this method, surface polarization charges on a homogeneous dielectric object are the unknowns, and the relationship between the electric field and surface polarization charges are employed to establish the integral equations. The discretization of such an integral equation and the treatment for singularity integration are discussed. Since the proposed method is compatible with non-conformal meshes, it reduces the meshing complexity for dielectric objects in contact, while the number of unknowns of the proposed method is intermediate compared with conventional methods. The proposed method is general for electrostatic field, magnetostatic field and stationary current field simulations. To demonstrate the feasibility, accuracy and efficiency of this approach, numerical tests and comparison with conventional methods are presented in this paper.
{"title":"Self Surface Charge Method for Static Field Simulation Compatible With Non-Conformal Meshes","authors":"Zhong Yuan Pang;Bo O. Zhu","doi":"10.1109/JMMCT.2025.3538602","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3538602","url":null,"abstract":"Numerical analysis of static field problems is often encountered in science and engineering. The boundary element methods based on integral equations are popular due to small number of unknowns and high computational efficiency. Conventional boundary element methods require conformal meshes on the interface between two contact dielectric objects, which are more complicated to generate than non-conformal meshes. This paper presents a boundary element integral equation method compatible with non-conformal meshes on the interface between contacting objects. In this method, surface polarization charges on a homogeneous dielectric object are the unknowns, and the relationship between the electric field and surface polarization charges are employed to establish the integral equations. The discretization of such an integral equation and the treatment for singularity integration are discussed. Since the proposed method is compatible with non-conformal meshes, it reduces the meshing complexity for dielectric objects in contact, while the number of unknowns of the proposed method is intermediate compared with conventional methods. The proposed method is general for electrostatic field, magnetostatic field and stationary current field simulations. To demonstrate the feasibility, accuracy and efficiency of this approach, numerical tests and comparison with conventional methods are presented in this paper.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"160-168"},"PeriodicalIF":1.8,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-30DOI: 10.1109/JMMCT.2025.3536795
Kirill V. Poletkin;Pavel Udalov;Alexey Lukin;Ivan Popov;Haojie Xia
An approach for calculation of the magnetic force arising between two electric current-carrying filaments having a circular and closed-curve of arbitrary shape is developed. The developed approach is based on the recently formulated segmentation method applied for the calculation of the mutual induction for a similar filament system. Employing the fact that any curve can be interpolated by a set of line segments with the desired accuracy and deriving the set of formulas for calculating of the magnetic force between a circular filament and line segment, the developed approach was also successfully applied for the estimation of the distribution of magnetic force along the closed-curve in addition to the resulting one. As illustrative examples, the calculation of the magnetic force and its distribution between the circular filament and the following closed-curves such as polygons, circles and a 3D curve was efficiently performed by using the developed approach. Also, the developed method was applied for the calculation of the resultant magnetic force between the rigid bodies including permanent magnets and current-carrying coils. The results of calculation were validated successfully by using FEM method and the analytical formulas available in the literature.
{"title":"Efficient Calculation of Magnetic Force Between Two Current-Carrying Filaments of Circular and Closed-Curve of Arbitrary Shape via Segmentation Approach","authors":"Kirill V. Poletkin;Pavel Udalov;Alexey Lukin;Ivan Popov;Haojie Xia","doi":"10.1109/JMMCT.2025.3536795","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3536795","url":null,"abstract":"An approach for calculation of the magnetic force arising between two electric current-carrying filaments having a circular and closed-curve of arbitrary shape is developed. The developed approach is based on the recently formulated segmentation method applied for the calculation of the mutual induction for a similar filament system. Employing the fact that any curve can be interpolated by a set of line segments with the desired accuracy and deriving the set of formulas for calculating of the magnetic force between a circular filament and line segment, the developed approach was also successfully applied for the estimation of the distribution of magnetic force along the closed-curve in addition to the resulting one. As illustrative examples, the calculation of the magnetic force and its distribution between the circular filament and the following closed-curves such as polygons, circles and a 3D curve was efficiently performed by using the developed approach. Also, the developed method was applied for the calculation of the resultant magnetic force between the rigid bodies including permanent magnets and current-carrying coils. The results of calculation were validated successfully by using FEM method and the analytical formulas available in the literature.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"137-150"},"PeriodicalIF":1.8,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143512994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-29DOI: 10.1109/JMMCT.2025.3535936
Xuyang Bai;Shurun Tan
The design complexity of photonic crystals and periodic gratings has been continuously increasing, driven by exploration of their unique physical phenomena and widespread applications. However, existing approaches for scattering modeling of periodic structures potentially encounter challenges when adapting to complex configurations, especially in the context of accurate near-field analysis and frequency responses near resonance. Meanwhile, they often exhibit difficulties in computational efficiency considering broadband simulations. Therefore, the development of an efficient and general scattering modeling approach to overcome these limitations has emerged as a crucial task. In this paper, an efficient surface integration equation (SIE)-based method is developed to model the scattering properties of arbitrary-shaped 2D gratings with 1D periodicity. The SIE is solved with a Nyström approach, which incorporates a local correction scheme and a Gaussian-Legendre quadrature rule. The evaluation of periodic Green's functions is achieved by combining an advanced imaginary wavenumber extraction technique with an integral transformation approach, which significantly increase the broadband simulation efficiency. Additionally, an over-determined matrix equation is constructed by testing the SIE with redundant observation points to mitigate potential internal resonance phenomena. The proposed approach is assessed through various numerical examples involving scatterers of different shapes and arrangements to demonstrate its accuracy and efficiency. The transmissivity spectra and surface field results, considering both normal and grazing incidence, are computed and compared against traditional approaches. The method proposed is found to be superior in accuracy and efficiency, especially when complicated evanescent modes are excited, and for broadband simulations.
{"title":"An Efficient Surface-Integral-Equation Based Nyström Method With an Over-Determined Testing Scheme for Broadband Grating Scattering Modeling","authors":"Xuyang Bai;Shurun Tan","doi":"10.1109/JMMCT.2025.3535936","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3535936","url":null,"abstract":"The design complexity of photonic crystals and periodic gratings has been continuously increasing, driven by exploration of their unique physical phenomena and widespread applications. However, existing approaches for scattering modeling of periodic structures potentially encounter challenges when adapting to complex configurations, especially in the context of accurate near-field analysis and frequency responses near resonance. Meanwhile, they often exhibit difficulties in computational efficiency considering broadband simulations. Therefore, the development of an efficient and general scattering modeling approach to overcome these limitations has emerged as a crucial task. In this paper, an efficient surface integration equation (SIE)-based method is developed to model the scattering properties of arbitrary-shaped 2D gratings with 1D periodicity. The SIE is solved with a Nyström approach, which incorporates a local correction scheme and a Gaussian-Legendre quadrature rule. The evaluation of periodic Green's functions is achieved by combining an advanced imaginary wavenumber extraction technique with an integral transformation approach, which significantly increase the broadband simulation efficiency. Additionally, an over-determined matrix equation is constructed by testing the SIE with redundant observation points to mitigate potential internal resonance phenomena. The proposed approach is assessed through various numerical examples involving scatterers of different shapes and arrangements to demonstrate its accuracy and efficiency. The transmissivity spectra and surface field results, considering both normal and grazing incidence, are computed and compared against traditional approaches. The method proposed is found to be superior in accuracy and efficiency, especially when complicated evanescent modes are excited, and for broadband simulations.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"125-136"},"PeriodicalIF":1.8,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143446272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-23DOI: 10.1109/JMMCT.2025.3533516
{"title":"2024 Index IEEE Journal on Multiscale and Multiphysics Computational Techniques Vol. 9","authors":"","doi":"10.1109/JMMCT.2025.3533516","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3533516","url":null,"abstract":"","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"9 ","pages":"415-426"},"PeriodicalIF":1.8,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10851470","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143106064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-17DOI: 10.1109/JMMCT.2025.3531134
Emanuel Colella;Benjamin A. Baldwin;Shaun F. Kelso;Luca Bastianelli;Valter Mariani Primiani;Franco Moglie;Gabriele Gradoni
The advent of noisy intermediate-scale quantum (NISQ) systems signifies an important stage in quantum computing development. Despite the constraints due to their limited qubit numbers and noise susceptibility, NISQ devices exhibit substantial potential to tackle complex computational challenges via hybrid classical-quantum algorithms. Among the various hybrid algorithms, variational quantum algorithms (VQAs) are gaining increasing attention due to their ability to solve highly complex, large-scale problems where classical algorithms fail. In particular, the variational quantum eigensolver (VQE) shows its potential in calculating the energies and ground states of large systems, where the complexity of solving such problems grows exponentially and becomes intractable for classical computers. At this regard, the aim of this paper is to extend the use of VQE for solving circular waveguide modes to verify their applicability to mathematically complex EM problems. In particular, we propose to calculate the fundamental and the some higher order modes for both transverse electric and transverse magnetic cases in circular waveguides. This is mathematically challenging due to the nature of geometry and the associated boundary conditions of circular structures. The results confirm the possibility of applying VQE for mathematically complex EM problems, announcing its potential to scale up and solve high-dimensional, large-scale EM problems where classical algorithms can fail.
{"title":"Variational Quantum Based Simulation of Cylindrical Waveguides","authors":"Emanuel Colella;Benjamin A. Baldwin;Shaun F. Kelso;Luca Bastianelli;Valter Mariani Primiani;Franco Moglie;Gabriele Gradoni","doi":"10.1109/JMMCT.2025.3531134","DOIUrl":"https://doi.org/10.1109/JMMCT.2025.3531134","url":null,"abstract":"The advent of noisy intermediate-scale quantum (NISQ) systems signifies an important stage in quantum computing development. Despite the constraints due to their limited qubit numbers and noise susceptibility, NISQ devices exhibit substantial potential to tackle complex computational challenges via hybrid classical-quantum algorithms. Among the various hybrid algorithms, variational quantum algorithms (VQAs) are gaining increasing attention due to their ability to solve highly complex, large-scale problems where classical algorithms fail. In particular, the variational quantum eigensolver (VQE) shows its potential in calculating the energies and ground states of large systems, where the complexity of solving such problems grows exponentially and becomes intractable for classical computers. At this regard, the aim of this paper is to extend the use of VQE for solving circular waveguide modes to verify their applicability to mathematically complex EM problems. In particular, we propose to calculate the fundamental and the some higher order modes for both transverse electric and transverse magnetic cases in circular waveguides. This is mathematically challenging due to the nature of geometry and the associated boundary conditions of circular structures. The results confirm the possibility of applying VQE for mathematically complex EM problems, announcing its potential to scale up and solve high-dimensional, large-scale EM problems where classical algorithms can fail.","PeriodicalId":52176,"journal":{"name":"IEEE Journal on Multiscale and Multiphysics Computational Techniques","volume":"10 ","pages":"104-111"},"PeriodicalIF":1.8,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143105959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：