The P'/f/ to N/h/ inversion problem in ionospheric soundings
Deriving ionospheric electron density as function of altitude from group path versus frequency measurements by vertical ionospheric sounders
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Deriving ionospheric electron density as function of altitude from group path versus frequency measurements by vertical ionospheric sounders
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Two cubic spline based approximation schemes for the estimation of structural parameters associated with the transverse vibration of flexible beams with tip appendages are outlined. The identification problem is formulated as a least squares fit to data subject to the system dynamics which are given by a hybrid system of coupled ordinary and partial differential equations. The first approximation scheme is based upon an abstract semigroup formulation of the state equation while a weak/variational form is the basis for the second. Cubic spline based subspaces together with a Rayleigh-Ritz-Galerkin approach were used to construct sequences of easily solved finite dimensional approximating identification problems. Convergence results are briefly discussed and a numerical example demonstrating the feasibility of the schemes and exhibiting their relative performance for purposes of comparison is provided.
A series of numerical examples is reported and several algorithms compared for estimation of coefficients in differential equation models. Unconstrained, constrained and Tikhonov regularization methods are tested for their behavior with regard to both convergence (of approximation methods for the states and parameters) and stability (continuity of the estimates with respect to perturbations in the data or observed states).
A theoretical framework is presented that can be used to treat approximation techniques for very general classes of parameter estimation problems involving distributed systems that are either first or second order in time. Using the approach developed, one can obtain both convergence and stability (continuous dependence of parameter estimates with respect to the observations) under very weak regularity and compactness assumptions on the set of admissible parameters. This unified theory can be used for many problems found in the recent literature and in many cases offers significant improvements to existing results.
Numerical techniques for parameter identification in distributed-parameter systems are developed analytically. A general convergence and stability framework (for continuous dependence on observations) is derived for first-order systems on the basis of (1) a weak formulation in terms of sesquilinear forms and (2) the resolvent convergence form of the Trotter-Kato approximation. The extension of this framework to second-order systems is considered.
In many applied problems (geophysics, medicine, and astronomy) we cannot directly measure the values x(t) of the desired physical quantity x in different moments of time, so we measure some related quantity y(t), and then we try to reconstruct the desired values x(t). This problem is often ill-posed in the sense that two essentially different functions x(t) are consistent with the same measurement results. So, in order to get a reasonable reconstruction, we must have some additional prior information about the desired function x(t). Methods that use this information to choose x(t) from the set of all possible solutions are called regularization methods. In some cases, we know the statistical characteristics both of x(t) and of the measurement errors, so we can apply statistical filtering methods (well-developed since the invention of a Wiener filter). In some situations, we know the properties of the desired process, e.g., we know that the derivative of x(t) is limited by some number delta, etc. In this case, we can apply standard regularization techniques (e.g., Tikhonov's regularization). In many cases, however, we have only uncertain knowledge about the values of x(t), about the rate with which the values of x(t) can change, and about the measurement errors. In these cases, usually one of the existing regularization methods is applied. There exist several heuristics that choose such a method. The problem with these heuristics is that they often lead to choosing different methods, and these methods lead to different functions x(t). Therefore, the results x(t) of applying these heuristic methods are often unreliable. We show that if we use fuzzy logic to describe this uncertainty, then we automatically arrive at a unique regularization method, whose parameters are uniquely determined by the experts knowledge. Although we start with the fuzzy description, but the resulting regularization turns out to be quite crisp.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
No abstract available
No abstract provided
Explore the source record for details and available documents.
Inverse scattering problem in quantum mechanics - inversion of eigenvalue problems
Partial differential equation (PDE)-governed inverse problems are fundamental across various scientific and engineering applications; yet they face significant challenges due to nonlinearity, ill-posedness, and sensitivity to noise. Here, we introduce a computational framework, regularization by denoising using diffusion models for partial differential equations (RED-DiffEq), by integrating physics-driven inversion and data-driven learning. RED-DiffEq leverages pretrained diffusion models as a regularization mechanism for PDE-governed inverse problems. We apply RED-DiffEq to solve the full waveform inversion problem in geophysics, a challenging seismic imaging technique that seeks to reconstruct high-resolution subsurface velocity models from seismic measurement data. Our method shows enhanced accuracy and robustness compared to benchmark methods. Additionally, it exhibits strong generalization and domain decomposition capacity, enabling the inversion of more complex velocity models with larger domains than those used in training the diffusion model. Our framework can also be directly applied to diverse PDE-governed inverse problems.
Neural networks have emerged as powerful tools for mapping between inputs and outputs. However, their black-box nature limits the ability to encode or impose specific structural relationships between inputs and outputs. Many scientific and engineering problems, such as constitutive modeling in solid mechanics, require networks that can enforce convexity, monotonicity, or other structural constraints to ensure physical consistency. Here, we introduce the Input Specific Neural Network (ISNN), a new architecture that enables multiple, distinct constraints to be imposed on different input subsets for scalar-valued outputs. This framework unifies convex, monotone–convex, monotone, and arbitrary mappings within a single network for the first time. Two ISNN architectures with analytical first- and second-order derivatives are developed. We demonstrate the performance on synthetic toy problems, inverse problems in isotropic hyperelasticity, and finite element simulations. ISNNs achieve improved extrapolation behavior, require fewer invariant inputs than standard input convex networks for polyconvex potentials, and enable significant computational savings via manual differentiation. We also show how ISNNs can be used to learn structural relationships between inputs and outputs via a binary gating mechanism. Particularly, ISNNs are employed to model a homogenized anisotropic free energy potential in a decoupled multiscale setting. The network learns whether or not the potential should be modeled as polyconvex and retains only the relevant layers while using the minimum number of inputs. ISNNs provide a flexible foundation for embedding structural priors into neural networks, enhancing both interpretability and stability. They are broadly applicable across computational mechanics and other scientific domains requiring constrained functional relationships.