Julia

swMATH13986WikidataQ2613697 ScholiaQ2613697MaRDI QIDQ25895FDOQ25895

Author name not available (Why is that?)

Described by source

• Julia: a fresh approach to numerical computing

Cited In (only showing first 100 items - show all)

• Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture
• On the numerical stability of the second barycentric formula for trigonometric interpolation in shifted equispaced points
• Linear-time variational integrators in maximal coordinates
• Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
• Distributionally robust SDDP
• Prescriptive analytics for human resource planning in the professional services industry
• A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
• Differential geometry and stochastic dynamics with deep learning numerics
• Comparison of densities obtained with competing density functional molecular codes
• Effective quantum dynamics on the Möbius strip
• The maximum matrix contraction problem
• Simulation of elliptic and hypo-elliptic conditional diffusions
• \(\Aut(\mathbb{F}_5)\) has property \((T)\)
• Energy stability of explicit Runge-Kutta methods for nonautonomous or nonlinear problems
• A nearly-conservative high-order Lagrange-Galerkin method for the resolution of scalar convection-dominated equations in non-divergence-free velocity fields
• A nearly-conservative, high-order, forward Lagrange-Galerkin method for the resolution of scalar hyperbolic conservation laws
• Robust topology optimization for harmonic displacement minimization of structures subjected to uncertainty in the excitation frequency
• A new class of \(A\) stable summation by parts time integration schemes with strong initial conditions
• Kinetic functions for nonclassical shocks, entropy stability, and discrete summation by parts
• Exact first-choice product line optimization
• The block-wise circumcentered-reflection method
• Unsupervised machine learning based on non-negative tensor factorization for analyzing reactive-mixing
• A three-term recurrence relation for accurate evaluation of transition probabilities of the simple birth-and-death process
• Julia language in machine learning: algorithms, applications, and open issues
• Computer algebra in Julia
• Using a template engine as a computer algebra tool
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• The influence of methylation status on a stochastic model of MGMT dynamics in glioblastoma: phenotypic selection can occur with and without a downshift in promoter methylation status
• Counterfactual regret minimization for integrated cyber and air defense resource allocation
• The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects
• Quartic first-order methods for low-rank minimization
• Quadratic maximization of reachable values of affine systems with diagonalizable matrix
• Tax-aware portfolio construction via convex optimization
• Entropy-stable, high-order summation-by-parts discretizations without interface penalties
• On high-order multilevel optimization strategies
• Disciplined quasiconvex programming
• A dynamical interval Newton method
• Anti-brane singularities as red herrings
• A multigrid solver to the Helmholtz equation with a point source based on travel time and amplitude
• Moment ideals of local Dirac mixtures
• A sparse spectral method for Volterra integral equations using orthogonal polynomials on the triangle
• Data-driven rogue waves and parameters discovery in nearly integrable \(\mathcal{PT}\)-symmetric Gross-Pitaevskii equations via PINNs deep learning
• A bio-inspired geometric model for sound reconstruction
• ChevLie: constructing Lie algebras and Chevalley groups
• Eigenvalues and eigenvectors of tau matrices with applications to Markov processes and economics
• Theta surfaces
• Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
• Sub-trees of a random tree
• ARC\(_q\): a new adaptive regularization by cubics
• Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
• Model-based data analysis of tissue growth in thin 3D printed scaffolds
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
• Approximate super-resolution of positive measures in all dimensions
• Data-driven model reduction, Wiener projections, and the Koopman-Mori-Zwanzig formalism
• Aligator.jl -- a Julia package for loop invariant generation
• Optimal survival trees
• Variational approximation error in non-negative matrix factorization
• A note on robust descent in differentiable optimization
• On a multilevel Levenberg-Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations
• Holographic bubbles with \texttt{Jecco}: expanding, collapsing and critical
• Robust product line design
• The infinite Lanczos method for symmetric nonlinear eigenvalue problems
• \texttt{pyomo.dae}: a modeling and automatic discretization framework for optimization with differential and algebraic equations
• Clustering the prevalence of pediatric chronic conditions in the United States using distributed computing
• New solution approaches for the maximum-reliability stochastic network interdiction problem
• \(k\)-adaptive routing for the robust network loading problem
• Continuous-discrete smoothing of diffusions
• Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
• Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs
• The exponentiated logarithmic generated family of distributions and the evaluation of the confidence intervals by percentile bootstrap
• Foundations of gauge and perspective duality
• Logistic regression: from art to science
• Statistical estimation in a randomly structured branching population
• An empirical Bayes approach to identification of modules in dynamic networks
• Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
• Primes in arithmetic progressions and semidefinite programming
• Certifiably optimal sparse inverse covariance estimation
• Variational time discretizations of higher order and higher regularity
• Certifying numerical estimates of spectral gaps
• Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix
• Circumcentering the Douglas-Rachford method
• The lower bound of the network connectivity guaranteeing in-phase synchronization
• Issues in the Software Implementation of Stochastic Numerical Runge–Kutta
• A local radial basis function-finite difference (RBF-FD) method for solving 1D and 2D coupled Schrödinger-Boussinesq (SBq) equations
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting
• EAGO.jl: easy advanced global optimization in Julia
• Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
• Solving Natural Conic Formulations with Hypatia.jl
• Efficient Stochastic Programming in Julia
• Solving Nonlinear Equations with Iterative Methods: Solvers and Examples in Julia
• A comparison of programming languages in macroeconomics
• Delamination influence on elastic properties of laminated composites
• On resampling schemes for particle filters with weakly informative observations
• Circumcentering approximate reflections for solving the convex feasibility problem
• OR forum: An algorithmic approach to linear regression
• The shape of the Julia set of an expanding rational map
• Combining spectral and POD modes to improve error estimation of numerical model reduction for porous media
• Cardinality-constrained risk parity portfolios
• A fast Chebyshev method for simulating flexible-wing propulsion
• Analytical-numerical implementation of polyvector algebra in Julia

This page was built for software: Julia