{"payload":{"pageCount":3,"repositories":[{"type":"Public","name":"NFFT.jl","owner":"JuliaMath","isFork":false,"description":"Julia implementation of the Non-equidistant Fast Fourier Transform (NFFT)","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":16,"starsCount":141,"forksCount":24,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-28T15:09:01.732Z"}},{"type":"Public","name":"FFTW.jl","owner":"JuliaMath","isFork":false,"description":"Julia bindings to the FFTW library for fast Fourier transforms","allTopics":["math","julia","bindings","fft","fftw","mkl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":5,"issueCount":53,"starsCount":264,"forksCount":53,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,0,1,1,0,6,0,5,1,0,0,0,0,1,0,0,0,0,1,0,3,0,1,0,0,2],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-28T12:02:45.271Z"}},{"type":"Public","name":"DoubleFloats.jl","owner":"JuliaMath","isFork":false,"description":"math with more good bits","allTopics":["performance","math","julia","accuracy","floating-point","precision","extended-precision","doubledouble"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":15,"starsCount":145,"forksCount":32,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-27T19:12:06.430Z"}},{"type":"Public","name":"MeasureTheory.jl","owner":"JuliaMath","isFork":false,"description":"\"Distributions\" that might not add to one.","allTopics":["machine-learning","statistics","probability","probabilistic-programming","bayesian-inference","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":17,"issueCount":52,"starsCount":385,"forksCount":31,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-27T00:50:30.928Z"}},{"type":"Public","name":"FixedPointDecimals.jl","owner":"JuliaMath","isFork":false,"description":"Julia fixed-point decimals built from integers","allTopics":["decimal-numbers"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":7,"issueCount":15,"starsCount":30,"forksCount":23,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-26T15:13:20.455Z"}},{"type":"Public","name":"openlibm","owner":"JuliaMath","isFork":false,"description":"High quality system independent, portable, open source libm implementation","allTopics":["c","cross-platform","math-library","openlibm"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":1,"issueCount":32,"starsCount":494,"forksCount":137,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-25T13:40:52.865Z"}},{"type":"Public","name":"Roots.jl","owner":"JuliaMath","isFork":false,"description":"Root finding functions for Julia","allTopics":["math","julia","root-finding"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":14,"starsCount":324,"forksCount":53,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-16T00:53:05.365Z"}},{"type":"Public","name":"Polynomials.jl","owner":"JuliaMath","isFork":false,"description":"Polynomial manipulations in Julia","allTopics":["math","julia","polynomials"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":29,"starsCount":299,"forksCount":74,"license":"Other","participation":[0,0,1,0,0,2,4,5,0,4,2,0,1,0,0,0,0,0,2,0,0,3,6,0,0,0,0,0,1,2,0,2,0,2,0,0,0,0,0,3,1,0,1,0,1,0,0,2,3,3,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-14T19:15:24.892Z"}},{"type":"Public","name":"Sobol.jl","owner":"JuliaMath","isFork":false,"description":"generation of Sobol low-discrepancy sequence (LDS) for the Julia language","allTopics":["math","monte-carlo","sobol-sequence","low-discrepancy-sequence","quasi-monte-carlo","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":5,"starsCount":76,"forksCount":15,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-12T00:35:42.978Z"}},{"type":"Public","name":"DecFP.jl","owner":"JuliaMath","isFork":false,"description":"Julia IEEE decimal floating-point via the Intel decimal-float library","allTopics":["math","decimal","floating-point","decimal-floating-point","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":8,"starsCount":55,"forksCount":22,"license":"Other","participation":[2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-10T23:27:12.734Z"}},{"type":"Public","name":"RandomMatrices.jl","owner":"JuliaMath","isFork":false,"description":"Random matrices package for Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":12,"starsCount":83,"forksCount":38,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-10T21:51:42.958Z"}},{"type":"Public","name":"DensityInterface.jl","owner":"JuliaMath","isFork":false,"description":"Interface for mathematical/statistical densities in Julia","allTopics":["measures","likelihood","distributions","densities","log-likelihood","log-density","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":6,"starsCount":11,"forksCount":3,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-05T14:36:49.766Z"}},{"type":"Public","name":"Primes.jl","owner":"JuliaMath","isFork":false,"description":"Prime numbers in Julia","allTopics":["math","julia","prime-numbers"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":9,"issueCount":16,"starsCount":93,"forksCount":31,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T23:50:09.180Z"}},{"type":"Public","name":"RealDot.jl","owner":"JuliaMath","isFork":false,"description":"Compute `real(dot(x, y))` efficiently.","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":4,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T23:26:44.387Z"}},{"type":"Public","name":"Calculus.jl","owner":"JuliaMath","isFork":false,"description":"Calculus functions in Julia","allTopics":["calculus","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":13,"issueCount":26,"starsCount":275,"forksCount":78,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T23:17:31.733Z"}},{"type":"Public","name":"ChangesOfVariables.jl","owner":"JuliaMath","isFork":false,"description":"Interface for transformation functions in Julia","allTopics":["math","julia","transformations","space-transformation","change-of-variables"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":4,"starsCount":10,"forksCount":4,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T23:07:15.787Z"}},{"type":"Public","name":"InverseFunctions.jl","owner":"JuliaMath","isFork":false,"description":"Interface for function inversion in Julia","allTopics":["math","julia","reverse-functions","inverse-function"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":2,"starsCount":25,"forksCount":9,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T23:05:52.420Z"}},{"type":"Public","name":"AbstractFFTs.jl","owner":"JuliaMath","isFork":false,"description":"A Julia framework for implementing FFTs","allTopics":["math","julia","fft"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":10,"issueCount":29,"starsCount":122,"forksCount":32,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T22:54:19.579Z"}},{"type":"Public","name":"Cubature.jl","owner":"JuliaMath","isFork":false,"description":"One- and multi-dimensional adaptive integration routines for the Julia language","allTopics":["integration","math","numerical-integration","julia","cubature"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":7,"starsCount":123,"forksCount":23,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T21:29:18.736Z"}},{"type":"Public","name":"HCubature.jl","owner":"JuliaMath","isFork":false,"description":"pure-Julia multidimensional h-adaptive integration","allTopics":["integration","math","numerical-integration","cubature","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":14,"starsCount":147,"forksCount":23,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T21:27:58.949Z"}},{"type":"Public","name":"NaNMath.jl","owner":"JuliaMath","isFork":false,"description":"Julia math built-ins which return NaN and accumulator functions which ignore NaN","allTopics":["math","floating-point","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":7,"issueCount":10,"starsCount":52,"forksCount":26,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T21:01:45.146Z"}},{"type":"Public","name":"Richardson.jl","owner":"JuliaMath","isFork":false,"description":"Richardson extrapolation in Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":60,"forksCount":4,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T20:55:24.825Z"}},{"type":"Public","name":"TensorCore.jl","owner":"JuliaMath","isFork":false,"description":"Lightweight package for sharing tensor-algebra definitions","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":1,"starsCount":23,"forksCount":6,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T20:43:25.112Z"}},{"type":"Public","name":"GSL.jl","owner":"JuliaMath","isFork":false,"description":"Julia interface to the GNU Scientific Library (GSL)","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":4,"starsCount":99,"forksCount":30,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T20:31:00.033Z"}},{"type":"Public","name":"KahanSummation.jl","owner":"JuliaMath","isFork":false,"description":"Sum and cumulative sum using the Kahan-Babuska-Neumaier algorithm","allTopics":["math","julia","kahan-summation","summation"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":3,"starsCount":20,"forksCount":12,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T20:10:22.018Z"}},{"type":"Public","name":"Xsum.jl","owner":"JuliaMath","isFork":false,"description":"exactly rounded double-precision summation for Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":15,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T19:57:40.138Z"}},{"type":"Public","name":"OverflowContexts.jl","owner":"JuliaMath","isFork":false,"description":"Fine control of integer overflow checking.","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":2,"starsCount":7,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-29T04:53:02.453Z"}},{"type":"Public","name":"FixedPointNumbers.jl","owner":"JuliaMath","isFork":false,"description":"fixed point types for julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":5,"issueCount":16,"starsCount":79,"forksCount":34,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-28T10:46:46.823Z"}},{"type":"Public","name":"Bessels.jl","owner":"JuliaMath","isFork":false,"description":"Bessel functions for real arguments and orders","allTopics":["bessel"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":12,"starsCount":78,"forksCount":10,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-25T01:33:19.735Z"}},{"type":"Public","name":"QuadGK.jl","owner":"JuliaMath","isFork":false,"description":"adaptive 1d numerical Gauss–Kronrod integration in Julia","allTopics":["integration","math","quadrature","numerical-integration","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":3,"issueCount":7,"starsCount":250,"forksCount":34,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-22T15:05:54.066Z"}}],"repositoryCount":70,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}