Jove
Visualize
联系我们
JoVE
x logofacebook logolinkedin logoyoutube logo
关于 JoVE
概览领导团队博客JoVE 帮助中心
作者
出版流程编辑委员会范围与政策同行评审常见问题投稿
图书馆员
用户评价订阅访问资源图书馆顾问委员会常见问题
研究
JoVE JournalMethods CollectionsJoVE Encyclopedia of Experiments存档
教育
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab Manual教师资源中心教师网站
使用条款与条件
隐私政策
政策

相关概念视频

Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

59
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
59
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

38
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...
38
Linear time-invariant Systems01:23

Linear time-invariant Systems

202
A system is linear if it displays the characteristics of homogeneity and additivity, together termed the superposition property. This principle is fundamental in all linear systems. Linear time-invariant (LTI) systems include systems with linear elements and constant parameters.
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
202
Kinematic Equations - II01:17

Kinematic Equations - II

9.2K
The second kinematic equation expresses the final position of an object in terms of its initial position, the distance traveled with the initial constant velocity, and the distance traveled due to a change in velocity. Similar to the first kinematic equation, this equation is also only valid when the acceleration is constant throughout the motion of an object.
Suppose a car merges into freeway traffic on a 200 m long ramp. If its initial velocity is 10 m/s and it accelerates at 2 m/s2, then the...
9.2K
Kinematic Equations: Problem Solving01:15

Kinematic Equations: Problem Solving

11.8K
When analyzing one-dimensional motion with constant acceleration, the problem-solving strategy involves identifying the known quantities and choosing the appropriate kinematic equations to solve for the unknowns. Either one or two kinematic equations are needed to solve for the unknowns, depending on the known and unknown quantities. Generally, the number of equations required is the same as the number of unknown quantities in the given example. Two-body pursuit problems always require two...
11.8K
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

84
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
84

您也可能阅读

相关文章

通过共同作者、期刊和引用图与本文相关的文章。

排序
Same author

Non-Preemptive Tree Packing.

Algorithmica·2023
Same author

Matroid bases with cardinality constraints on the intersection.

Mathematical programming·2022
Same author

The Steiner cycle and path cover problem on interval graphs.

Journal of combinatorial optimization·2022
Same author

The multi-stripe travelling salesman problem.

Annals of operations research·2017
Same journal

A better-than-1.6-approximation for prize-collecting TSP.

Mathematical programming·2026
Same journal

A <math><mrow><mfrac><mn>4</mn> <mn>3</mn></mfrac></mrow></math> -approximation for the maximum leaf spanning arborescence problem in DAGs.

Mathematical programming·2026
Same journal

An FPTAS for Connectivity Interdiction.

Mathematical programming·2026
Same journal

A first order method for linear programming parameterized by circuit imbalance.

Mathematical programming·2026
Same journal

Tight lower bounds for block-structured integer programs.

Mathematical programming·2026
Same journal

Accelerated first-order optimization under nonlinear constraints.

Mathematical programming·2026
查看所有相关文章

相关实验视频

Updated: May 24, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

472

一个线性时间算法,用于线化二次和高阶最短路径问题.

Eranda Çela1, Bettina Klinz1, Stefan Lendl2

  • 1Institute of Discrete Mathematics, Graz University of Technology, Graz, Austria.

Mathematical programming
|March 3, 2025
PubMed
概括
此摘要是机器生成的。

研究人员开发了一种更快的线性时间算法,用于在非循环二进制图上解决正方形最短路径问题 (QSPP). 这种新方法有效地确定QSPP实例是否可线性化,将其简化为经典的最短路径问题 (SPP).

关键词:
高级最短路径问题线性化 线性化 线性化平方最短路径问题

更多相关视频

Trajectory Data Analyses for Pedestrian Space-time Activity Study
16:14

Trajectory Data Analyses for Pedestrian Space-time Activity Study

Published on: February 25, 2013

13.5K
Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street
14:55

Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street

Published on: January 20, 2023

3.2K

相关实验视频

Last Updated: May 24, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

472
Trajectory Data Analyses for Pedestrian Space-time Activity Study
16:14

Trajectory Data Analyses for Pedestrian Space-time Activity Study

Published on: February 25, 2013

13.5K
Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street
14:55

Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street

Published on: January 20, 2023

3.2K

科学领域:

  • 离散的数学 离散的数学
  • 理论计算机科学 理论计算机科学
  • 图形理论 图形理论

背景情况:

  • 二次最短路径问题 (QSPP) 是一个NP难题.
  • 一个QSPP实例的线性化意味着它与经典的最短路径问题 (SPP) 相当.
  • QSPP的线性化问题 (LinQSPP) 识别了可线性化实例及其相应的SPP.

研究的目的:

  • 为LinQSPP开发一种新的,高效的算法,用于非循环二进制图.
  • 改进解决LinQSPP的现有算法.
  • 将这些发现扩展到更高阶的最短路径问题.

主要方法:

  • 一个新的线性时间算法用于LinQSPP在非循环二进制图上.
  • 利用一种新的洞察力,即线性可变性是非循环二进制图的局部属性.
  • 基于图形穿越和局部属性分析的算法设计.

主要成果:

  • 一个线性时间算法LinQSPP在非循环二进制图,超过以前的方法.
  • 证明QSPP在非循环二进制图上的线性化是一种局部属性.
  • 这种方法可以扩展到更高阶的最短路径问题.

结论:

  • 在非循环二进制图上开发了一种显著更快的LinQSPP算法.
  • 当地属性洞察力简化了QSPP线性化的分析和解决方案.
  • 提出的方法为一类最短路径问题提供了更有效的方法.