default search action
Bernard Kapidani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Bernard Kapidani, Melina Merkel
, Sebastian Schöps
Arbitrary order spline representation of cohomology generators for isogeometric analysis of eddy current problems. Adv. Comput. Math. 50(5): 92 (2024) - [j5]Markus Wess
Mass lumping the dual cell method to arbitrary polynomial degree for acoustic and electromagnetic waves. J. Comput. Phys. 513: 113196 (2024) - [i9]Mario Mally, Bernard Kapidani, Melina Merkel, Sebastian Schöps:
Tree-Cotree-Based Tearing and Interconnecting for 3D Magnetostatics: A Dual-Primal Approach. CoRR abs/2407.21707 (2024) - 2023
- [j4]Bernard Kapidani, Rafael Vázquez
High order geometric methods with splines: Fast solution with explicit time-stepping for Maxwell equations. J. Comput. Phys. 493: 112440 (2023) - [i8]Bernard Kapidani, Rafael Vázquez:
High order geometric methods with splines: fast solution with explicit time-stepping for Maxwell equations. CoRR abs/2302.04979 (2023) - [i7]Bernard Kapidani, Melina Merkel, Sebastian Schöps, Rafael Vázquez:
Arbitrary order spline representation of cohomology generators for isogeometric analysis of eddy current problems. CoRR abs/2310.14313 (2023) - [i6]Markus Wess, Bernard Kapidani, Lorenzo Codecasa, Joachim Schöberl:
Mass lumping the dual cell method to arbitrary polynomial degree for acoustic and electromagnetic waves. CoRR abs/2312.14716 (2023) - 2022
- [j3]Bernard Kapidani
High Order Geometric Methods With Splines: An Analysis of Discrete Hodge-Star Operators. SIAM J. Sci. Comput. 44(6): 3673- (2022) - [i5]Melina Merkel, Bernard Kapidani, Sebastian Schöps, Rafael Vázquez Hernández:
Torque Computation with the Isogeometric Mortar Method for the Simulation of Electric Machines. CoRR abs/2202.05771 (2022) - [i4]Bernard Kapidani, Rafael Vázquez Hernández:
High order geometric methods with splines: an analysis of discrete Hodge-star operators. CoRR abs/2203.00620 (2022) - 2021
- [j2]Bernard Kapidani, Lorenzo Codecasa, Joachim Schöberl:
An arbitrary-order Cell Method with block-diagonal mass-matrices for the time-dependent 2D Maxwell equations. J. Comput. Phys. 433: 110184 (2021) - [i3]Bernard Kapidani, Melina Merkel, Sebastian Schöps, Rafael Vázquez Hernández:
Tree-Cotree Decomposition of Isogeometric Mortared Spaces in H(curl) on Multi-Patch Domains. CoRR abs/2110.15860 (2021) - 2020
- [i2]Bernard Kapidani, Lorenzo Codecasa, Joachim Schöberl:
An arbitrary-order Cell Method with block-diagonal mass-matrices for the time-dependent 2D Maxwell equations. CoRR abs/2001.07544 (2020) - [i1]Bernard Kapidani, Joachim Schöberl:
A matrix-free Discontinuous Galerkin method for the time dependent Maxwell equations in unbounded domains. CoRR abs/2002.08733 (2020)
2010 – 2019
- 2014
- [j1]David Esseni
Tunnel FETs for Ultralow Voltage Digital VLSI Circuits: Part I - Device-Circuit Interaction and Evaluation at Device Level. IEEE Trans. Very Large Scale Integr. Syst. 22(12): 2488-2498 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: