Search NASA⌕ Search

SEARCH · Search NASA

Results for “MATHEMATICS - BOUNDARY VALUES”

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.

At least 1,459 records · Page 81

Multiscale Persistent Functions for Biomolecular Structure Characterization

Here in this paper, we introduce multiscale persistent functions for biomolecular structure characterization. The essential idea is to combine our multiscale rigidity functions (MRFs) with persistent homology analysis, so as to construct a series of multiscale persistent functions, particularly multiscale persistent entropies, for structure characterization. To clarify the fundamental idea of our method, the multiscale persistent entropy (MPE) model is discussed in great detail. Mathematically, unlike the previous persistent entropy (Chintakunta et al. in Pattern Recognit 48(2):391–401, 2015; Merelli et al. in Entropy 17(10):6872–6892, 2015; Rucco et al. in: Proceedings of ECCS 2014, Springer, pp 117–128, 2016), a special resolution parameter is incorporated into our model. Various scales can be achieved by tuning its value. Physically, our MPE can be used in conformational entropy evaluation. More specifically, it is found that our method incorporates in it a natural classification scheme. This is achieved through a density filtration of an MRF built from angular distributions. To further validate our model, a systematical comparison with the traditional entropy evaluation model is done. Additionally, it is found that our model is able to preserve the intrinsic topological features of biomolecular data much better than traditional approaches, particularly for resolutions in the intermediate range. Moreover, by comparing with traditional entropies from various grid sizes, bond angle-based methods and a persistent homology-based support vector machine method (Cang et al. in Mol Based Math Biol 3:140–162, 2015), we find that our MPE method gives the best results in terms of average true positive rate in a classic protein structure classification test. More interestingly, all-alpha and all-beta protein classes can be clearly separated from each other with zero error only in our model. Finally, a special protein structure index (PSI) is proposed, for the first time, to describe the “regularity” of protein structures. Basically, a protein structure is deemed as regular if it has a consistent and orderly configuration. Our PSI model is tested on a database of 110 proteins; we find that structures with larger portions of loops and intrinsically disorder regions are always associated with larger PSI, meaning an irregular configuration, while proteins with larger portions of secondary structures, i.e., alpha-helix or beta-sheet, have smaller PSI. Essentially, PSI can be used to describe the “regularity” information in any systems.

59 BASIC BIOLOGICAL SCIENCES↗

Mathematical Reconstruction of Land Carbon Models From Their Numerical Output: Computing Soil Radiocarbon From C Dynamics

Radiocarbon ( 14 C) is a powerful tracer of the global carbon cycle that is commonly used to assess carbon cycling rates in various Earth system reservoirs and as a benchmark to assess model performance. Therefore, it has been recommended that Earth System Models (ESMs) participating in the Coupled Model Intercomparison Project Phase 6 report predicted radiocarbon values for relevant carbon pools. However, a detailed representation of radiocarbon dynamics may be an impractical burden on model developers. Here, we present an alternative approach to compute radiocarbon values from the numerical output of an ESM that does not explicitly represent these dynamics. The approach requires computed 12 C stocks and fluxes among all carbon pools for a particular simulation of the model. From this output, a time-dependent linear compartmental system is computed with its respective state-transition matrix. Using transient atmospheric 14 C values as inputs, the state-transition matrix is then applied to compute radiocarbon values for each pool, the average value for the entire system, and component fluxes. We demonstrate the approach with ELMv1-ECA, the land component of an ESM model that explicitly represents 12 C, and 14 C in 7 soil pools and 10 vertical layers. Results from our proposed method are highly accurate (relative error <0.01%) compared with the ELMv1-ECA 12 C and 14 C predictions, demonstrating the potential to use this approach in CMIP6 and other model simulations that do not explicitly represent 14 C.

54 ENVIRONMENTAL SCIENCES↗

Computing for Finance

The finance sector is one of the driving forces for the use of distributed or Grid computing for business purposes. The speakers will review the state-of-the-art of high performance computing in the financial sector, and provide insight into how different types of Grid computing – from local clusters to global networks - are being applied to financial applications. They will also describe the use of software and techniques from physics, such as Monte Carlo simulations, in the financial world. There will be four talks of 20min each. The talk abstracts and speaker bios are listed below. This will be followed by a Q&A; panel session with the speakers. From 19:00 onwards there will be a networking cocktail for audience and speakers. This is an EGEE / CERN openlab event organized in collaboration with the regional business network rezonance.ch. A webcast of the event will be made available for subsequent viewing, along with powerpoint material presented by the speakers. Attendance is free and open to all. Registration is mandatory via www.rezonance.ch, including for CERN staff. 1. Overview of High Performance Computing in the Financial Industry Michael Yoo, Managing Director, Head of the Technical Council, UBS Presentation will describe the key business challenges driving the need for HPC solutions, describe the means in which those challenges are being addressed within UBS (such as GRID) as well as the limitations of some of these solutions, and assess some of the newer HPC technologies which may also play a role in the Financial Industry in the future. Speaker Bio: Michael originally joined the former Swiss Bank Corporation in 1994 in New York as a developer on a large data warehouse project. In 1996 he left SBC and took a role with Fidelity Investments in Boston. Unable to stay away for long, he returned to SBC in 1997 while working for Perot Systems in Singapore. Finally, in 1998 he formally returned to UBS in Stamford following the merger with SBC and has remained with UBS for the past 9 years. During his tenure at UBS, he has had a number of leadership roles within IT in development, support and architecture. In 2006 Michael relocated to Switzerland to take up his current role as head of the UBS IB Technical Council, responsible for the overall technology strategy and vision of the Investment Bank. One of Michael's key responsibilities is to manage the UBS High Performance Computing Research Lab and he has been involved in a number of initiatives in the HPC space. 2. Grid in the Commercial WorldFred Gedling, Chief Technology Officer EMEA and Senior Vice President Global Services, DataSynapse Grid computing gets mentions in the press for community programs starting last decade with Seti@Home. Government, national and supranational initiatives in grid receive some press. One of the IT-industries' best-kept secrets is the use of grid computing by commercial organizations with spectacular results. Grid Computing and its evolution into Application Virtualization is discussed and how this is key to the next generation data center. Speaker Bio: Fred Gedling holds the joint roles of Chief Technology Officer for EMEA and Senior Vice President of Global Services at DataSynapse, a global provider of application virtualisation software. Based in London and working closely with organisations seeking to optimise their IT infrastructures, Fred offers unique insights into the technology of virtualisation as well as the methodology of establishing ROI and rapid deployment to the immediate advantage of the business. Fred has more than fifteen years experience of enterprise middleware and high-performance infrastructures. Prior to DataSynapse he worked in high performance CRM middleware and was the CTO EMEA for New Era of Networks (NEON) during the rapid growth of Enterprise Application Integration. His 25-year career in technology also includes management positions at Goldman Sachs and Stratus Computer. Fred holds a First Class Bsc (Hons) degree in Physics with Astrophysics from the University of Leeds and had the privilege of being a summer student at CERN.3. Opportunities for gLite in finance and related industriesAdam Vile, Head of Grid, HPC and Technical Computing, Excelian Ltd.gLite, the Grid software developed by the EGEE project, has been exceedingly successful as an enabling infrastructure, and has been a massive success in bringing together scientific and technical communities to provide the compute power to address previously incomputable problems. Not so in the finance industry. In its current form gLite would be a business disabler. There are other middleware tools that solve the finance communities compute problems much better. Things are moving on, however. There are moves afoot in the open source community to evolve the technology to address other, more sophisticated needs such as utility and interactive computing. In this talk, I will describe how Excelian is providing Grid consultancy services for the finance community and how, through its relationship to the EGEE project, Excelian is helping to identify and exploit opportunities as the research and business worlds converge. Because of the strong third party presence in the finance industry, such opportunities are few and far between, but they are there, especially as we expand sideways into related verticals such as the smaller hedge funds and energy companies. This talk will give an overview of the barriers to adoption of gLite in the finance industry and highlight some of the opportunities offered in this and related industries as the ideas around Grid mature. Speaker Bio: Dr Adam Vile is a senior consultant and head of the Grid and HPC practice at Excelian, a consultancy that focuses on financial markets professional services. He has spent many years in investment banking, as a developer, project manager and architect in both front and back office. Before joining Excelian he was senior Grid and HPC architect at Barclays Capital. Prior to joining investment banking, Adam spent a number of years lecturing in IT and mathematics at a UK University and maintains links with academia through lectures, research and through validation and steering of postgraduate courses. He is a chartered mathematician and was the conference chair of the Institute of Mathematics and its Applications first conference in computational Finance. 4. From Monte Carlo to Wall Street Daniel Egloff, Head of Financial Engineering Computing Unit, Zürich Cantonal Bank High performance computing techniques provide new means to solve computationally hard problems in the financial service industry. First I consider Monte Carlo simulation and illustrate how it can be used to implement a sophisticated credit risk management and economic capital framework. From a HPC perspective, basic Monte Carlo simulation is embarrassingly parallel and can be implemented efficiently on distributed memory clusters. Additional difficulties arise for adaptive variance reduction schemes, if the information content in a sample is very small, and if the amount of simulated date becomes huge such that incremental processing algorithms are indispensable. We discuss the business value of an advanced credit risk quantification which is particularly compelling in these days. While Monte Carlo simulation is a very versatile tool it is not always the preferred solution for the pricing of complex products like multi asset options, structured products, or credit derivatives. As a second application I show how operator methods can be used to develop a pricing framework. The scalability of operator methods relies heavily on optimized dense matrix-matrix multiplications and requires specialized BLAS level-3 implementations provided by specialized FPGA or GPU boards. Speaker Bio: Daniel Egloff studied mathematics, theoretical physics, and computer science at the University of Zurich and the ETH Zurich. He holds a PhD in Mathematics from University of Fribourg, Switzerland. After his PhD he started to work for a large Swiss insurance company in the area of asset and liability management. He continued his professional career in the consulting industry. At KPMG and Arthur Andersen he consulted international clients and implemented quantitative risk management solutions for financial institutions and insurance companies. In 2002 he joined Zurich Cantonal Bank. He was assigned to develop and implement credit portfolio risk and economic capital methodologies. He built up a competence center for high performance and cluster computing. Currently, Daniel Egloff is heading the Financial Computing unit in the ZKB Financial Engineering division. He and his team is engineering and operating high performance cluster applications for computationally intensive problems in financial risk management.

BUSINESS VALUE↗

Routes to fractality and entropy in Liesegang systems

Liesegang bands are formed when solutions of co-precipitate ions interdiffuse in a 1D gel matrix. In a recent study [R. F. Sultan, Acta. Mech. Sin. 27, 119 (2011)], Liesegang patterns have been characterized as fractal structures. In addition to experimentally obtained patterns, geometric Liesegang patterns were constructed in conformity with the well-known empirical laws. Both mathematical fractal dimensions and box count dimensions for images of PbF{sub 2} and PbI{sub 2} Liesegang patterns have been calculated. Liesegang patterns can also be described by the entropy state function, and categorized as more or less ordered structures. We revisit the relation between entropy and fractal dimension, and apply it to simulated geometrical Liesegang patterns. We have resort to three different routes for the estimation of the entropy of a Liesegang pattern. The HarFA software enabled the calculation of the Hausdorff dimension and the topological entropy, then the information dimension and the Shannon entropy. In a third pathway, analytical calculations were carried out by estimating the probability of occurrence of a fractal element or coverage. The product of Shannon entropy and Boltzmann constant yields the thermodynamic entropy. The values for PbF{sub 2} and PbI{sub 2} Liesegang patterns attained the order of magnitude of the reported Third Law entropies, but yet remained lower, in conformity with the more ordered Liesegang structures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-E-T-578: On Definition of Minimum and Maximum Dose for Target Volume

Purpose: This study aims to investigate the impact of different minimum and maximum dose definitions in radiotherapy treatment plan quality evaluation criteria by using tumor control probability (TCP) models. Methods: Dosimetric criteria used in RTOG 1308 protocol are used in the investigation. RTOG 1308 is a phase III randomized trial comparing overall survival after photon versus proton chemoradiotherapy for inoperable stage II-IIIB NSCLC. The prescription dose for planning target volume (PTV) is 70Gy. Maximum dose (Dmax) should not exceed 84Gy and minimum dose (Dmin) should not go below 59.5Gy in order for the plan to be “per protocol” (satisfactory).A mathematical model that simulates the characteristics of PTV dose volume histogram (DVH) curve with normalized volume is built. The Dmax and Dmin are noted as percentage volumes Dη% and D(100-δ)%, with η and d ranging from 0 to 3.5. The model includes three straight line sections and goes through four points: D95%= 70Gy, Dη%= 84Gy, D(100-δ)%= 59.5 Gy, and D100%= 0Gy. For each set of η and δ, the TCP value is calculated using the inhomogeneously irradiated tumor logistic model with D50= 74.5Gy and γ50=3.52. Results: TCP varies within 0.9% with η; and δ values between 0 and 1. With η and η varies between 0 and 2, TCP change was up to 2.4%. With η and δ variations from 0 to 3.5, maximum of 8.3% TCP difference is seen. Conclusion: When defined maximum and minimum volume varied more than 2%, significant TCP variations were seen. It is recommended less than 2% volume used in definition of Dmax or Dmin for target dosimetric evaluation criteria. This project was supported by NIH grants U10CA180868, U10CA180822, U24CA180803, U24CA12014 and PA CURE Grant.

61 RADIATION PROTECTION AND DOSIMETRY↗

Relationship Between MP and DPP for the Stochastic Optimal Control Problem of Jump Diffusions

This paper is concerned with the stochastic optimal control problem of jump diffusions. The relationship between stochastic maximum principle and dynamic programming principle is discussed. Without involving any derivatives of the value function, relations among the adjoint processes, the generalized Hamiltonian and the value function are investigated by employing the notions of semijets evoked in defining the viscosity solutions. Stochastic verification theorem is also given to verify whether a given admissible control is optimal.

97 MATHEMATICS AND COMPUTING↗

Two-Sided Semi-Local Smoothing Splines

A semi-local smoothing spline of degree n and class C{sup p} is a function defined on an interval, having p continuous derivatives on that interval, and coinciding with a polynomial of degree n on the subintervals forming its partition. The domain of each polynomial is a subinterval on which m + 1 values of the approximated function are given, but in order to construct the polynomial, it is necessary to know M ≥ m + 1 values (m and M are determined by the class and the degree of the spline). The additional values can be borrowed from the adjacent subintervals. When constructing an S-spline in the periodic case, the problem of additional values is solved on the basis of periodicity, but in the nonperiodic case, one is expected to define the lacking values of a function beyond the domain. The present paper is aimed at nonperiodic two-sided S-splines whose construction does not require additional data.

97 MATHEMATICS AND COMPUTING↗

Dispatch optimization of concentrating solar power with utility-scale photovoltaics

Concentrating solar power (CSP) tower technologies capture thermal radiation from the sun utilizing a field of solar-tracking heliostats. When paired with inexpensive thermal energy storage (TES), CSP technologies can dispatch electricity during peak-market-priced hours, day or night. The cost of utility-scale photovoltaic (PV) systems has dropped significantly in the last decade, resulting in inexpensive energy production during daylight hours. The hybridization of PV and CSP with TES systems has the potential to provide continuous and stable energy production at a lower cost than a PV or CSP system alone. Hybrid systems are gaining popularity in international markets as a means to increase renewable energy portfolios across the world. Typically, CSP-PV hybrid systems have been evaluated using either monthly averages of hourly PV production or scheduling algorithms that neglect the time-of-production value of electricity in the market. To more accurately evaluate a CSP-PV-battery hybrid design, we develop a profit-maximizing mixed-integer linear program ($\mathcal{H}$) that determines a dispatch schedule for the individual sub-systems with a sub-hourly time fidelity. We introduce the mathematical formulation of such a model and show that it is computationally expensive to solve. To improve model tractability and reduce solution times, we offer techniques that: (1) reduce the problem size, (2) tighten the linear programming relaxation of ($\mathcal{H}$) via reformulation and the introduction of cuts, and (3) implement an optimization-based heuristic (that can yield initial feasible solutions for (($\mathcal{H}$) and, at any rate, yields near-optimal solutions). Applying these solution techniques results in a 79% improvement in solve time, on average, for our 48-h instances of (($\mathcal{H}$); corresponding solution times for an annual model run decrease by as much as 93%, where such a run consists of solving 365 instances of (($\mathcal{H}$), retaining only the first 24 h' worth of the solution, and sliding the time window forward 24 h. We present annual system metrics for two locations and two markets that inform design practices for hybrid systems and lay the groundwork for a more exhaustive policy analysis. A comparison of alternative hybrid systems to the CSP-only system reflects that hybrid models can almost double capacity factors while resulting in a 30% improvement related to various economic metrics.

14 SOLAR ENERGY↗

Linear fractional differential equations and eigenfunctions of fractional differential operators

Eigenfunctions associated with Riemann–Liouville and Caputo fractional differential operators are obtained by imposing a restriction on the fractional derivative parameter. Those eigenfunctions can be used to express the analytical solution of some linear sequential fractional differential equations. As a first application, we discuss analytical solutions for the so-called fractional Helmholtz equation with one variable, obtained from the standard equation in one dimension by replacing the integer order derivative by the Riemann–Liouville fractional derivative. A second application consists of an initial value problem for a fractional wave equation in two dimensions in which the integer order partial derivative with respect to the time variable is replaced by the Caputo fractional derivative. The classical Mittag-Leffler functions are important in the theory of fractional calculus because they emerge as solutions of fractional differential equations. Starting with the solution of a specific fractional differential equation in terms of these functions, we find a way to express the exponential function in terms of classical Mittag-Leffler functions. A remarkable characteristic of this relation is that it is true for any value of the parameter n appearing in the definition of the functions, i.e., we have an infinite family of different expressions for e{sup x} in terms of classical Mittag-Leffler functions.

97 MATHEMATICS AND COMPUTING↗

A Galerkin method with two-dimensional Haar basis functions for the computation of the Karhunen–Loève expansion

We study the numerical approximation of a homogeneous Fredholm integral equation of second kind associated with the Karhunen–Loève expansion of Gaussian random fields. We develop, validate, and discuss an algorithm based on the Galerkin method with two-dimensional Haar wavelets as basis functions. The shape functions are constructed from the orthogonal decomposition of tensor-product spaces of one-dimensional Haar functions, and a recursive algorithm is employed to compute the matrix of the discrete eigenvalue system without the explicit calculation of integrals, allowing the implementation of a fast and efficient algorithm that provides considerable reduction in CPU time, when compared with classical Galerkin methods. Numerical experiments confirm the convergence rate of the method and assess the approximation error and the sparsity of the eigenvalue system when the wavelet expansion is truncated. We illustrate the numerical solution of a diffusion problem with random input data with the present method. In this problem, accuracy was retained after dropping the coefficients below a threshold value that was numerically determined. A similar method with scaling functions rather than wavelet functions does not need a discrete wavelet transform and leads to eigenvalue systems with better conditioning but lower sparsity.

97 MATHEMATICS AND COMPUTING↗

Weak values and weak coupling maximizing the output of weak measurements

In a weak measurement, the average output 〈o〉 of a probe that measures an observable A{sup -hat} of a quantum system undergoing both a preparation in a state ρ{sub i} and a postselection in a state E{sub f} is, to a good approximation, a function of the weak value A{sub w}=Tr[E{sub f}A{sup -hat} ρ{sub i}]/Tr[E{sub f}ρ{sub i}], a complex number. For a fixed coupling λ, when the overlap Tr[E{sub f}ρ{sub i}] is very small, A{sub w} diverges, but 〈o〉 stays finite, often tending to zero for symmetry reasons. This paper answers the questions: what is the weak value that maximizes the output for a fixed coupling? What is the coupling that maximizes the output for a fixed weak value? We derive equations for the optimal values of A{sub w} and λ, and provide the solutions. The results are independent of the dimensionality of the system, and they apply to a probe having a Hilbert space of arbitrary dimension. Using the Schrödinger–Robertson uncertainty relation, we demonstrate that, in an important case, the amplification 〈o〉 cannot exceed the initial uncertainty σ{sub o} in the observable o{sup -hat}, we provide an upper limit for the more general case, and a strategy to obtain 〈o〉≫σ{sub o}. - Highlights: •We have provided a general framework to find the extremal values of a weak measurement. •We have derived the location of the extremal values in terms of preparation and postselection. •We have devised a maximization strategy going beyond the limit of the Schrödinger–Robertson relation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parameter Estimation and Uncertainty Quantification for Systems Biology Models

Mathematical models can provide quantitative insights into immunoreceptor signaling, and other biological processes, but require parameterization and uncertainty quantification before reliable predictions become possible. We review currently available methods and software tools to address these problems. We consider gradient-based and gradient-free methods for point estimation of parameter values, and methods of profile likelihood, bootstrapping, and Bayesian inference for uncertainty quantification. We consider recent and potential future applications of these methods to systems-level modeling of immune-related phenomena.

59 BASIC BIOLOGICAL SCIENCES↗

Simple analytical model for fitting QENS data from liquids

The advent of new generation of neutron spectrometers for quasielastic scattering measurements has demonstrated the need for multi-component (at least two-component) fitting of data collected from liquids. The narrowest component is associated with long-range translational diffusion, whereas the broader component originates from localized center-of-mass motions in the transient cage of the nearest neighbors. Intra-particle dynamics (e.g., of molecular side groups) may give rise to additional components besides the center-of-mass motions. We present a simple analytical model for two-component fits of quasielastic neutron scattering data collected from liquids. Here, the use of such models is optional (albeit helpful) in the traditional approach, where fits are performed sequentially and independently for the data collected at separate Q values, but imperative in the global fitting, where the data are fitted simultaneously at all Q values, which may be necessary to rationalize the data from increasingly complex systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Short-depth QAOA circuits and quantum annealing on higher-order ising models

Abstract We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p = 1, 2 rounds is executed on the 127 qubit heavy-hex graph gate-model quantum computer ibm_washington, using on-device grid-searches for angle finding, and QA is executed on two Pegasus-chip D-Wave quantum annealers. The problems are random Ising models whose connectivity matches heavy-hex graphs and the Pegasus graph connectivity, and optionally include hardware-compatible cubic terms ( Z Z Z terms). The QAOA circuits are heavily optimized and of extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of the heavy-hex lattice. QAOA and QA are both compared against simulated annealing and the optimal solutions are computed exactly using CPLEX. The noiseless mean QAOA expectation values for p = 1, 2 are computed using classical light-cone based simulations. We find QA outperforms QAOA on the evaluated devices.

127 qubits↗

de Sitter breaking through infrared divergences

Just because the propagator of some field obeys a de Sitter invariant equation does not mean it possesses a de Sitter invariant solution. The classic example is the propagator of a massless, minimally coupled scalar. We show that the same thing happens for massive scalars with M{sub S}{sup 2}<0 and for massive transverse vectors with M{sub V}{sup 2}<=-2(D-1)H{sup 2}, where D is the dimension of space-time and H is the Hubble parameter. Although all masses in these ranges give infrared divergent mode sums, using dimensional regularization (or any other analytic continuation technique) to define the mode sums leads to the incorrect conclusion that de Sitter invariant solutions exist except at discrete values of the masses.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The model with many moments for relativistic electron beams: A simplified solution

In the 1980s, Amendt and Weitzner proposed an interesting model capable to describe relativistic electron beams. It concerned 14 independent variables and the closure was obtained by using the entropy and the Einstein relativity principles. As we know from literature, an extension to many moments allows to achieve an improvement in the results. Three years ago, we exhibited a macroscopic model with an arbitrary but fixed number of moments for relativistic extended thermodynamics. Such model was more general than those previously appeared in literature, so it was applicable even to materials different from an electron beam. Subsequently, we found the closure of such model consistent with the entropy and the Einstein relativity principles, up to whatever order with respect to equilibrium. The solution was determined in terms of a family of arbitrary single variable functions arising from integration. Those results have a very complex shape and are very difficult to handle so a simplification is necessary. In this paper we will reach this goal. Furthermore, we will prove that by fixing a certain order n{sub p} with respect to equilibrium and a scalar valued single variable function, appearing at that order, then all the terms appearing at orders n{<=}n{sub p} are determined without introducing any other function. This result has already been found for the nonrelativistic case but its extension to the relativistic framework is not straightforward and it requires a supplementary mathematical tool: the above mentioned simplification in the shape of the solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Flexible nuclear screening approximation to the two-electron spin–orbit coupling based on ab initio parameterization

The derivation, implementation, and validation of a new approximation to the two-electron spin–orbit coupling (SOC) terms is reported. The approximation, referred to as flexible nuclear screening spin–orbit, is based on the effective one-electron spin–orbit operator and accounts for two-electron SOC effects by screening nuclear charges. A highly flexible scheme for the nuclear screening is developed, mainly using parameterization based on ab initio atomic SOC calculations. Tabulated screening parameters are provided for contracted and primitive Gaussian-type basis functions of the ANO-RCC basis set for elements from H to Cm. The strategy for their adaptation to any other Gaussian basis set is presented and validated. A model to correct for the effect of splitting of transition metal d orbitals on their SOC matrix elements is introduced. The method is applied to a representative set of molecules, and compared to exact treatment and other approximative approaches at the same level of relativistic theory. The calculated SOC matrix elements are in very good agreement with their “exact” values; deviation below 1% is observed on average. The presented approximation is considered to be generally applicable, simple to implement, highly efficient, and accurate.

74 ATOMIC AND MOLECULAR PHYSICS↗

Electromagnetic waves in an optical photonic lattice

Laser light propagation in a photonic lattice consisting of two parallel waveguide arrays is theoretically studied using the coupled mode method, with the interaction of each waveguide with the nearest neighbours and between the waveguides of the arrays being taken into account. Analytical expressions are obtained that make it possible to accurately predict the presence of localisation of light depending on the coupling constants. Particular solutions of a system of coupled waves are found, which describe strongly localised light propagating without transverse diffraction along the entire lattice at certain values of the coupling constants. The emergence of spatially limited transverse diffraction of light is predicted. (integral optics)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗