Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a uniform background velocity and speed of sound , linearized conservation of mass, the Euler equation and the local equation of state give this wave equation. In the coordinate it is the ordinary one-dimensional wave equation. Its two characteristic curves travel at laboratory velocities and ; both point downstream in supersonic flow.
For a continuously differentiable function, a descent direction and , the Wolfe conditions require both the Armijo condition andThis second inequality is the weak curvature condition: the slope must have become less negative. The strong variant instead requires . The weak version already guarantees a positive curvature pair for the Quasi-Newton secant equation.
Start with a trial step size and repeatedly replace by , with , until the Armijo condition holds. For a differentiable function and a descent direction, the short-step argument in the Armijo condition proves finite termination. This alone does not enforce the curvature part of the Wolfe conditions.
For and a descent direction , the Armijo condition asks for a decrease at least a fixed fraction of the decrease predicted by the first-order Taylor expansion. Put . Differentiability gives for all sufficiently small positive . Thus the condition is satisfiable without a second derivative.
A vector is a descent direction for a differentiable function at if its directional derivative is negative. The first-order expansion then gives for sufficiently small positive . The negative gradient is a descent direction whenever the gradient is nonzero.
A line search that finds a global minimizer along the chosen ray, provided one exists. For a negative gradient direction, its decrease in the objective function is at least that of any admissible fixed step size. The cost of solving this one-dimensional minimization problem must be included when comparing computation time.
Target: vector-space.bigb, under Vector subspace.Redirection of incident light into outgoing directions at a material boundary or through scattering near it. Specular reflection concentrates light around a geometric reflection direction; diffuse reflection distributes it more broadly. This physical process is distinct from reflection as a mathematical transformation.
At tree level in a local Fermi interaction with negligible neutrino masses, the charged daughter mass modifies the integrated three-body V-A interaction rate by . The function tends to one at zero daughter mass and to zero at threshold. It includes both the phase space restriction and the momentum dependence of the matrix element.
If is a strict function and for every , then
f (foldl g a xs) = foldl h (f a) xs. Prove the equation simultaneously for all accumulators by structural induction on the list. The empty case is immediate; at a cons, apply the hypothesis with accumulator g a x and then rewrite its image using the assumed equation. At the bottom value, strictness supplies the required equality. For pure definable functions, equality on finite partial lists extends to infinite lazy lists by finite approximations. For finite terminating spines alone, strictness is unnecessary.A right fold can build a function that accepts the initial accumulator later. Its empty result is
id; its step prepends one update before the continuation supplied by the tail. The invariant foldr c id xs a = foldl s a xs, quantified over all a, follows from the two fold equations. Both applied sides give the bottom value on an undefined spine; finite approximation then covers infinite lazy lists. The larger result type retains information that a direct same-result-type fold can lose.The hypothesis that matching instructional format to a learner's assessed style improves learning relative to mismatching. It requires an appropriate preference-by-format comparison, not merely a preference questionnaire or a format main effect.
A list whose spine or elements may contain bottom values. The displayed value has a known finite spine prefix and an undefined tail. An entirely undefined list exposes no outer constructor, while
[] exposes a terminating empty list. These distinctions matter to strict functions and to the fold factorisation criterion.A stream computation is productive when every demanded finite prefix of its output can be produced in finite work. Filtering an infinite list need not be productive: asking for odd elements of
[0,2..] never produces even an empty-list constructor. Lazy evaluation alone does not prove productivity.A generic correct scan cannot always terminate with a certificate that a value is absent from an arbitrary infinite list. Any terminating scan observes only finitely many elements. Changing the unobserved tail to include the value preserves all its observations but invalidates the certificate. The same argument prevents certifying that no occurrence follows the last one already found. A promise such as strict ascending order can provide an independent stopping rule. This explains why mathematical occurrence sets and computed occurrence-position representations of a sequence need different treatment on infinite inputs.
A proper lazy list has a spine exposing either finitely many cons constructors followed by
[], or infinitely many cons constructors, without an undefined tail at a finite position. This is a condition on the spine: an element may itself be the bottom value without hiding the list's constructors. A partial list with a finite visible prefix followed by fails this condition. The distinction supports productivity proofs that inspect constructors without evaluating the stored elements.Represent a cursor by an underlying consuming iterator plus an optional cached head. Without a cache, its abstract sequence is the iterator's sequence; with cached , it is concatenated with the remaining iterator sequence.
current fetches and caches exactly one value when needed, repeated reads reuse it, and advance discards it. Availability testing need not fetch a value, and construction need not query the input. This avoids forcing a future stream element that the client may never request.Q-switching creates a short high-energy optical pulse by first storing population inversion while an optical cavity has high loss, then increasing its quality factor so that stimulated emission rapidly extracts the stored excitation. Its duration depends on photon lifetime, excess optical gain, inversion depletion and switching time; it is not fixed by a universal time-bandwidth equality.
A laser rate equation approximates coupled evolution of population inversion and intracavity photon number, including pumping, spontaneous emission, stimulated emission and optical cavity losses. A simple model is , , where compatible normalizations absorb mode-volume factors. Large excess optical gain drives rapid field growth until inversion depletion reduces it below threshold.
The material in which pumping produces optical gain through stimulated emission. Its inversion density, mode-overlap volume and emission cross section determine whether the gain overcomes cavity losses.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





