Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
Lagrange Multipliers: Problem Solving01:30

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Probabilistic multi-site MR image harmonization via feature preserving conditional generative adversarial networks.

Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society·2026
Same author

Reconstruction of glymphatic transport fields from subject-specific imaging data, with particular emphasis on cerebrospinal fluid flow and tracer conservation.

ArXiv·2026
Same author

Systemic Barium Toxicity Manifesting As Acute Hypokalemic Paralysis and Respiratory Failure Following a Firework Injury.

Cureus·2026
Same author

Biomechanical index for predicting the risk of acute coronary syndrome.

Frontiers in cardiovascular medicine·2026
Same author

Machine learning based classification of aggressive and malignant renal tumors from multimodal data.

PLOS digital health·2026
Same author

Acute Aortic Occlusion Mimicking Cauda Equina Syndrome: Complete Neurologic Recovery After Emergent Endovascular Revascularization.

Cureus·2026

Related Experiment Videos

An optimal Petrov-Galerkin framework for operator networks.

Philip Charles1, Deep Ray1, Yue Yu2

  • 1Department of Mathematics, University of Maryland.

Computer Methods in Applied Mechanics and Engineering
|June 25, 2026
PubMed
Summary
This summary is machine-generated.

A new deep learning framework, Petrov-Galerkin Variationally Mimetic Operator Network (PG-VarMiON), implicitly learns optimal weighting functions for solving partial differential equations. This approach enhances generalization and robustness, especially with limited training data.

Related Experiment Videos

Area of Science:

  • Computational mathematics
  • Scientific machine learning
  • Numerical analysis

Background:

  • The optimal Petrov-Galerkin formulation provides the best approximation for partial differential equations (PDEs).
  • Constructing optimal weighting functions for this formulation is challenging in multi-dimensional problems.
  • Deep learning offers a potential avenue for overcoming these construction limitations.

Purpose of the Study:

  • To develop a deep learning framework that emulates the optimal Petrov-Galerkin weak form.
  • To enable implicit learning of optimal weighting functions for enhanced generalization.
  • To demonstrate the efficacy of the proposed method for solving PDEs.

Main Methods:

  • Introduction of the Petrov-Galerkin Variationally Mimetic Operator Network (PG-VarMiON).
  • Supervised training of the operator network using PDE data and solutions.
  • Derivation of approximation error estimates for the PG-VarMiON framework.

Main Results:

  • PG-VarMiON implicitly learns optimal weighting functions, improving generalization.
  • The method shows greater robustness and improved generalization compared to other deep operator frameworks.
  • Numerical results for the advection-diffusion equation validate the proposed approach, especially with limited data.

Conclusions:

  • PG-VarMiON effectively emulates the optimal Petrov-Galerkin weak form.
  • The framework offers a robust and generalizable solution for PDEs, particularly in data-scarce scenarios.
  • This deep learning approach advances the application of optimal Petrov-Galerkin methods.