rnburn | 2 years ago | on: Beverly Hills in crisis as judge mandates new affordable housing
rnburn's comments
rnburn | 2 years ago | on: Beverly Hills in crisis as judge mandates new affordable housing
rnburn | 2 years ago | on: Beverly Hills in crisis as judge mandates new affordable housing
rnburn | 2 years ago | on: Friends don't let friends make bad graphs
Tukey was one of Tufte's mentors.
rnburn | 2 years ago | on: Friends don't let friends make bad graphs
rnburn | 2 years ago | on: Cubic spline interpolation
> If f has v derivatives, with the vth derivative being of bounded variation V, then ||f - p_n|| = O(V n^{-v}) as n -> ∞
and
> If f is analytic, the convergence is geometric, with ||f - p_n|| = O(p^{-n}) for some p > 1
You will not get that good of a rate of convergence with cubic splines. See https://www.researchgate.net/publication/243095286_On_the_Or...
This is further explained in Trefethen's book https://www.amazon.com/Approximation-Theory-Practice-Applied...
Quoting from Ch 14
> In fact, polynomial interpolants in Chebyshev points are problem-free when evaluated by the barycentric interpolation formula. They have the same behavior as discrete Fourier series for period functions, whose reliability nobody worries about. The introduction of splines is a red herring: the true advantage of splines is not that they converge where polynomials fail to do so, but that they are more easility adapted to irregular point distributions and more localized.
You can see also the software package https://www.chebfun.org/ for Chebyshev interpolations with Matlab and https://github.com/rnburn/bbai for Chebyshev interpolation of arbitrary dimension functions with sparse grids for Python. And here is a quick notebook for an experiment you can run that will compare Chebyshev interpolants to cubic splines: https://github.com/rnburn/bbai/blob/master/example/13-sparse...
rnburn | 2 years ago | on: Cubic spline interpolation
This is a misconception that's often repeated. High degree polynomial interpolations are problematic if you use equispaced points. If you use Chebyshev points, they are highly accurate and in general perform much better than cubic splines. See myth 1 from Lloyd Trefethen's paper: https://people.maths.ox.ac.uk/trefethen/mythspaper.pdf
rnburn | 2 years ago | on: Why software projects take longer than you think: a statistical model (2019)
Research has shown a power-law distribution to be a better fit.
See "The Empirical Reality of IT Project Cost Overruns: Discovering a Power-Law Distribution" https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4204819
rnburn | 2 years ago | on: Spike in Homelessness in US Cities Isn’t Slowing Down
I don't know how deedclaim computed those numbers, or the reliability of the source; but California most definitely has a shortage of housing. The numbers I quoted come from the McKinsey Global institute study: https://web.archive.org/web/20161105022549/https://www.mckin...
And local policy is very much a problem. Briefly as described in https://www.youtube.com/watch?v=0IHEMHc2yfY, California has a lot of housing restrictions, a high cost of construction, and processes that make it easy for housing opponents to block new developments.
And your statement "you will see fewer homeless people moving to California to camp in a tent and then finding it tough to get back into housing." is not an accurate characterization. Most of the homeless in California are Californians. Quoting from 2023 UCSF homeless study (https://homelessness.ucsf.edu/sites/default/files/2023-06/CA...): "People experiencing homelessness in California are Californians. Nine out of ten participants lost their last housing in California; 75% of participants lived in the same county as their last housing"